#include "gap.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll a[100010], mx;
int n;
long long findGap(int T, int N)
{
n = N;
if(T == 1)
{
MinMax(0,1e18,a,a + n-1);
for(int i = 1; i < n/2; i++)
MinMax(a[0]+1,a[n-1]-1,a + i,a + n-1-i);
}
for(int i = 0; i < n-1; i++)
mx = max(mx,a[i+1]-a[i]);
return mx;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
5924 KB |
Output is correct |
2 |
Incorrect |
0 ms |
5924 KB |
Output isn't correct |
3 |
Incorrect |
0 ms |
5924 KB |
Output isn't correct |
4 |
Incorrect |
0 ms |
5924 KB |
Output isn't correct |
5 |
Incorrect |
0 ms |
5924 KB |
Output isn't correct |
6 |
Incorrect |
0 ms |
5924 KB |
Output isn't correct |
7 |
Incorrect |
0 ms |
5924 KB |
Output isn't correct |
8 |
Incorrect |
0 ms |
5924 KB |
Output isn't correct |
9 |
Incorrect |
0 ms |
5924 KB |
Output isn't correct |
10 |
Incorrect |
0 ms |
5924 KB |
Output isn't correct |
11 |
Incorrect |
0 ms |
5924 KB |
Output isn't correct |
12 |
Incorrect |
0 ms |
5924 KB |
Output isn't correct |
13 |
Incorrect |
0 ms |
5924 KB |
Output isn't correct |
14 |
Incorrect |
0 ms |
5924 KB |
Output isn't correct |
15 |
Incorrect |
0 ms |
5924 KB |
Output isn't correct |
16 |
Incorrect |
9 ms |
5924 KB |
Output isn't correct |
17 |
Incorrect |
16 ms |
5924 KB |
Output isn't correct |
18 |
Incorrect |
13 ms |
5924 KB |
Output isn't correct |
19 |
Incorrect |
16 ms |
5924 KB |
Output isn't correct |
20 |
Incorrect |
6 ms |
5924 KB |
Output isn't correct |
21 |
Incorrect |
53 ms |
5924 KB |
Output isn't correct |
22 |
Incorrect |
56 ms |
5924 KB |
Output isn't correct |
23 |
Incorrect |
39 ms |
5924 KB |
Output isn't correct |
24 |
Incorrect |
46 ms |
5924 KB |
Output isn't correct |
25 |
Incorrect |
29 ms |
5924 KB |
Output isn't correct |
26 |
Incorrect |
46 ms |
5924 KB |
Output isn't correct |
27 |
Incorrect |
56 ms |
5924 KB |
Output isn't correct |
28 |
Incorrect |
49 ms |
5924 KB |
Output isn't correct |
29 |
Incorrect |
46 ms |
5924 KB |
Output isn't correct |
30 |
Incorrect |
23 ms |
5924 KB |
Output isn't correct |
31 |
Correct |
0 ms |
5924 KB |
Output is correct |
32 |
Correct |
0 ms |
5924 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
0 ms |
5924 KB |
Output isn't correct |
2 |
Incorrect |
0 ms |
5924 KB |
Output isn't correct |
3 |
Incorrect |
0 ms |
5924 KB |
Output isn't correct |
4 |
Incorrect |
0 ms |
5924 KB |
Output isn't correct |
5 |
Incorrect |
0 ms |
5924 KB |
Output isn't correct |
6 |
Incorrect |
0 ms |
5924 KB |
Output isn't correct |
7 |
Incorrect |
0 ms |
5924 KB |
Output isn't correct |
8 |
Incorrect |
0 ms |
5924 KB |
Output isn't correct |
9 |
Incorrect |
0 ms |
5924 KB |
Output isn't correct |
10 |
Incorrect |
0 ms |
5924 KB |
Output isn't correct |
11 |
Incorrect |
0 ms |
5924 KB |
Output isn't correct |
12 |
Incorrect |
0 ms |
5924 KB |
Output isn't correct |
13 |
Incorrect |
0 ms |
5924 KB |
Output isn't correct |
14 |
Incorrect |
0 ms |
5924 KB |
Output isn't correct |
15 |
Incorrect |
0 ms |
5924 KB |
Output isn't correct |
16 |
Incorrect |
9 ms |
5924 KB |
Output isn't correct |
17 |
Incorrect |
6 ms |
5924 KB |
Output isn't correct |
18 |
Incorrect |
9 ms |
5924 KB |
Output isn't correct |
19 |
Incorrect |
6 ms |
5924 KB |
Output isn't correct |
20 |
Incorrect |
3 ms |
5924 KB |
Output isn't correct |
21 |
Incorrect |
29 ms |
5924 KB |
Output isn't correct |
22 |
Incorrect |
36 ms |
5924 KB |
Output isn't correct |
23 |
Incorrect |
23 ms |
5924 KB |
Output isn't correct |
24 |
Incorrect |
33 ms |
5924 KB |
Output isn't correct |
25 |
Incorrect |
33 ms |
5924 KB |
Output isn't correct |
26 |
Incorrect |
29 ms |
5924 KB |
Output isn't correct |
27 |
Incorrect |
26 ms |
5924 KB |
Output isn't correct |
28 |
Incorrect |
33 ms |
5924 KB |
Output isn't correct |
29 |
Incorrect |
29 ms |
5924 KB |
Output isn't correct |
30 |
Incorrect |
13 ms |
5924 KB |
Output isn't correct |
31 |
Incorrect |
0 ms |
5924 KB |
Output isn't correct |
32 |
Incorrect |
0 ms |
5924 KB |
Output isn't correct |