| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 109297 | b2563125 | Gap (APIO16_gap) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<iostream>
#include<algorithm>
#include<vector>
#include "gap.h"
using namespace std;
#define ll long long
#define vel vector<long long>
#define rep(i,n) for(int i=0;i<n;i++)
int pr = 1000000007;
int ref(int &a) {
a = a % pr;
a += pr;
a = a % pr;
return a;
}
ll findgap(ll t, ll n) {
vel a(n);
ll mn = 0; ll mx = (pr - 7);
mx *= mx;
rep(i, (n + 1) / 2) {
MinMax(mn, mx, &mn, &mx);
a[i] = mn;
a[n - 1 - i] = mx;
mn++; mx--;
}
ll ans = 0;
rep(i, n - 1) { ans = max(ans, a[i + 1] - a[i]); }
return ans;
}