#include <iostream>
#include "gap.h"
#define n 100010
long long a[n];
long long max(long long a, long long b) {
return a > b ? a : b;
}
long long findGap(int T, int N)
{
if (T == 1) {
MinMax(0, 1e18, &a[1], &a[N]);
for(int i = 2; i <= (N + 1) / 2; i++) {
MinMax(a[i - 1] + 1, a[N - i + 2] - 1, &a[i], &a[N - i + 1]);
}
long long ans = a[2] - a[1];
for (int i = 2; i<N; i++) ans = max(ans, a[i + 1] - a[i]);
return ans;
}
long long mn, mx, last, ans = -1;
MinMax(0, 1e18, &mn, &mx);
last = mn;
long long BLOCKSIZE = (mx - mn) / (N - 1);
if ((mx - mn) % (N - 1)) BLOCKSIZE++;
bool ok = false;
for (long long sBLOCK = mn + 1; sBLOCK <= mx;) {
long long fBLOCK = sBLOCK + BLOCKSIZE - 1;
if (fBLOCK >= mx) {
fBLOCK = mx - 1;
ok = true;
}
long long minNow, maxNow;
if (fBLOCK < sBLOCK) break;
MinMax(sBLOCK, fBLOCK, &minNow, &maxNow);
if (minNow == -1) {
sBLOCK = fBLOCK + 1;
if (ok) break;
continue;
}
if (minNow == maxNow) ans = max(ans, maxNow - last);
else ans = max(ans, max(maxNow - minNow, minNow - last));
last = maxNow;
sBLOCK = fBLOCK + 1;
if (ok) break;
}
ans = max(ans, mx - last);
return ans;
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
5920 KB |
Output is correct |
| 2 |
Correct |
0 ms |
5920 KB |
Output is correct |
| 3 |
Correct |
0 ms |
5920 KB |
Output is correct |
| 4 |
Correct |
0 ms |
5920 KB |
Output is correct |
| 5 |
Correct |
0 ms |
5920 KB |
Output is correct |
| 6 |
Correct |
0 ms |
5920 KB |
Output is correct |
| 7 |
Correct |
0 ms |
5920 KB |
Output is correct |
| 8 |
Correct |
0 ms |
5920 KB |
Output is correct |
| 9 |
Correct |
0 ms |
5920 KB |
Output is correct |
| 10 |
Correct |
0 ms |
5920 KB |
Output is correct |
| 11 |
Correct |
0 ms |
5920 KB |
Output is correct |
| 12 |
Correct |
0 ms |
5920 KB |
Output is correct |
| 13 |
Correct |
0 ms |
5920 KB |
Output is correct |
| 14 |
Correct |
0 ms |
5920 KB |
Output is correct |
| 15 |
Correct |
0 ms |
5920 KB |
Output is correct |
| 16 |
Correct |
13 ms |
5920 KB |
Output is correct |
| 17 |
Correct |
13 ms |
5920 KB |
Output is correct |
| 18 |
Correct |
6 ms |
5920 KB |
Output is correct |
| 19 |
Correct |
16 ms |
5920 KB |
Output is correct |
| 20 |
Correct |
9 ms |
5920 KB |
Output is correct |
| 21 |
Correct |
53 ms |
5920 KB |
Output is correct |
| 22 |
Correct |
53 ms |
5920 KB |
Output is correct |
| 23 |
Correct |
56 ms |
5920 KB |
Output is correct |
| 24 |
Correct |
53 ms |
5920 KB |
Output is correct |
| 25 |
Correct |
46 ms |
5920 KB |
Output is correct |
| 26 |
Correct |
59 ms |
5920 KB |
Output is correct |
| 27 |
Correct |
49 ms |
5920 KB |
Output is correct |
| 28 |
Correct |
49 ms |
5920 KB |
Output is correct |
| 29 |
Correct |
56 ms |
5920 KB |
Output is correct |
| 30 |
Correct |
46 ms |
5920 KB |
Output is correct |
| 31 |
Correct |
0 ms |
5920 KB |
Output is correct |
| 32 |
Correct |
0 ms |
5920 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
5920 KB |
Output is correct |
| 2 |
Correct |
0 ms |
5920 KB |
Output is correct |
| 3 |
Correct |
0 ms |
5920 KB |
Output is correct |
| 4 |
Correct |
0 ms |
5920 KB |
Output is correct |
| 5 |
Correct |
0 ms |
5920 KB |
Output is correct |
| 6 |
Correct |
0 ms |
5920 KB |
Output is correct |
| 7 |
Correct |
0 ms |
5920 KB |
Output is correct |
| 8 |
Correct |
0 ms |
5920 KB |
Output is correct |
| 9 |
Correct |
0 ms |
5920 KB |
Output is correct |
| 10 |
Correct |
0 ms |
5920 KB |
Output is correct |
| 11 |
Correct |
0 ms |
5920 KB |
Output is correct |
| 12 |
Correct |
0 ms |
5920 KB |
Output is correct |
| 13 |
Correct |
0 ms |
5920 KB |
Output is correct |
| 14 |
Correct |
0 ms |
5920 KB |
Output is correct |
| 15 |
Correct |
0 ms |
5920 KB |
Output is correct |
| 16 |
Correct |
19 ms |
5920 KB |
Output is correct |
| 17 |
Correct |
16 ms |
5920 KB |
Output is correct |
| 18 |
Correct |
16 ms |
5920 KB |
Output is correct |
| 19 |
Correct |
19 ms |
5920 KB |
Output is correct |
| 20 |
Correct |
9 ms |
5920 KB |
Output is correct |
| 21 |
Correct |
79 ms |
5920 KB |
Output is correct |
| 22 |
Correct |
76 ms |
5920 KB |
Output is correct |
| 23 |
Correct |
73 ms |
5920 KB |
Output is correct |
| 24 |
Correct |
76 ms |
5920 KB |
Output is correct |
| 25 |
Correct |
69 ms |
5920 KB |
Output is correct |
| 26 |
Correct |
69 ms |
5920 KB |
Output is correct |
| 27 |
Correct |
63 ms |
5920 KB |
Output is correct |
| 28 |
Correct |
69 ms |
5920 KB |
Output is correct |
| 29 |
Correct |
69 ms |
5920 KB |
Output is correct |
| 30 |
Correct |
43 ms |
5920 KB |
Output is correct |
| 31 |
Correct |
0 ms |
5920 KB |
Output is correct |
| 32 |
Correct |
0 ms |
5920 KB |
Output is correct |
