Ahmed Khaled akhal3d96
akhal3d96
/ Problem B solution.c
Last active
August 29, 2015 14:25
— forked from nagy3n/gist:9a0306212c3cd9efa581
Solution of Div312#2 Problem B http://codeforces.com/contest/558/problem/B
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| #include <stdio.h> | |
| #include <stdlib.h> | |
| #include <string.h> | |
| int main() | |
| { | |
| int times[1000001],indst[1000001],inden[1000001],n,i,f,maxn,max; | |
| maxn=-1; | |
| scanf("%d",&n); | |
| memset(times, 0, 1000001*sizeof(int)); | |
| for(i=0;i<n;i++) |