제출 #560852

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
560852		tamthegod	Gap (APIO16_gap)	C++14	100 / 100	55 ms	1880 KiB

gap

#include "gap.h"

#include<iostream>
#include<iomanip>
#include<algorithm>
#include<stack>
#include<queue>
#include<string>
#include<string.h>
#include<cmath>
#include<vector>
#include<map>
#include<unordered_map>
#include<set>
#include<unordered_set>
#include<cstdio>
#include<bitset>
#include<chrono>
#include<random>
#include<ext/rope>
/* ordered_set
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
*/
#define pb push_back
#define fi first
#define se second
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
const int maxN = 1e5 + 5;
const int mod = 1e9 + 7;
const ll oo = 1e18;
ll a[maxN];
ll findGap(int T, int n)
{
    if(T == 1)
    {
        int low = 1, high = n;
        a[n + 1] = (ll)2e18 + 1;
        while(low <= high)
        {
            MinMax(a[low - 1] + 1, a[high + 1] - 1, &a[low], &a[high]);
            low++;
            high--;
        }
        ll res = 0;
        for(int i=2; i<=n; i++)
            res = max(res, abs(a[i] - a[i - 1]));
        return res;
    }
    ll res = 0;
    MinMax(0, oo, &a[1], &a[n]);
    ll pre = a[1];
    ll h = (a[n] - a[1] + n - 2) / (n - 1);
    h--;
    ll now = a[1] + 1;
    while(true)
    {
        ll p, q;
        MinMax(now, now + h, &p, &q);
        res = max(res, p - pre);
        pre = max(pre, q);
        now += h + 1;
        if(q == a[n]) break;
    }
    return res;
}

• Subtask 1: 30 / 30
• Subtask 2: 70 / 70