# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
770611 | Enchom | 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 <stdio.h>
#include "gap.h"
using namespace std;
typedef long long llong;
llong solveSmall(int N)
{
llong minVal, maxVal;
llong L = 0, R = 1000000000000000000LL;
int pL = 0, pR = N - 1;
vector<llong> nums(N);
while(pL <= pR)
{
MinMax(L, R, &minVal, &maxVal);
nums[pL] = minVal;
nums[pR] = maxVal;
pL++;
pR--;
L = minVal + 1;
R = maxVal - 1;
}
llong ans = 0;
for (int i = 1; i < nums.size(); i++)
{
ans = max(ans, nums[i] - nums[i - 1]);
}
return ans;
}
llong solveBig(int N)
{
return 0LL;
}
llong findGap(int T, int N)
{
if (T == 1)
return solveSmall(N);
else
return solveBig(N);
}
/*
int main()
{
}
*/