제출 #923323

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
923323		hasan2006	Gap (APIO16_gap)	C++17	30 / 100	30 ms	5112 KiB

gap

#include <bits/stdc++.h>
#include "gap.h"
using namespace std;

#define TL ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
#define rall(s) s.rbegin(),s.rend()
#define all(s) s.begin(),s.end()
#define pb push_back
#define se second
#define fi first
#define ll long long
#define ld long double
#define YES cout<<"YES\n"
#define Yes cout<<"Yes\n"
#define yes cout<<"yes\n"
#define NO cout<<"NO\n"
#define No cout<<"No\n"
#define no cout<<"no\n"


const int N = 5e5 + 9 , mod = 1e9 + 7;
ll a[N] ;

ll findGap(int t , int n){
    ll ans = 0;
    if(t == 1){
        ll mx = 1e18;
        ll mn = 1;
        ll l , r;
        vector<int>v;
        for(int i = 1; i <= (n + 1) / 2; i++){
            MinMax(mn , mx , &l , &r);
            a[i] = l;
            if(l != r)
                a[n - i + 1] = r;
            mn = l + 1;
            mx = r - 1;
        }
        for(int i = 1; i < n; i++){
            ans = max(ans , a[i + 1] - a[i]);
        }
    }
    return ans;
}
/*
void solve()
{
    ll n , q , i , j ,l ,r , x , y , s = 0 , f , k , m , mx = 0 , mn = 1e18;

}

int main(){
    TL;
    #ifndef ONLINE_JUDGE
        freopen("input.txt", "r", stdin);
        freopen("output.txt", "w", stdout);
    #endif
int t = 1;
cin>>t;
while(t--)
     {
     solve();
     }
}
// Author : حسن
*/

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