제출 #775397

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

gap

#include <bits/stdc++.h>
#include "gap.h"
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
using namespace __gnu_pbds;
using namespace std;
typedef tree<int, null_type, less<int>, rb_tree_tag,
             tree_order_statistics_node_update>
    ordered_set;
//Dijkstra->set
//set.find_by_order(x) x-position value
//set.order_of_key(x) number of strictly less elements don't need *set.??
#define N 100005
#define wr cout << "Continue debugging\n";
#define all(x) (x).begin(), (x).end()
#define ll long long int
#define pii pair <int, int>
#define pb push_back
#define ff first
#define ss second

ll a[N];

ll findGap(int t, int n)
{
	if (t == 1){
		int l = 1, r = n; 
		ll mn = 0, mx = 1e18, ans = 0;
		while(l <= r){
			ll s = mn, t = mx;
			MinMax(s, t, &mn, &mx);
			a[l] = mn;
			a[r] = mx;
			if (l > 1) ans = max(ans, a[l]-a[l-1]);
			if (r < n) ans = max(ans, a[r+1]-a[r]);
			l++;
			r--;
			mn++;
			mx--;	
		}
		if (n == 2) return a[2]-a[1];
		return ans;
	}
	return 0;
}


// int main ()
// {
// 	ios::sync_with_stdio(false);
// 	cin.tie(0);
// 	cin >> t;
// 	while (t--){
			
// 	}
// }	

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