제출 #679191

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
679191		tigar	Gap (APIO16_gap)	C++14	30 / 100	44 ms	1960 KiB

gap

#include <bits/stdc++.h>
#include "gap.h"

using namespace std;

typedef long long ll;

ll mn, mx, niz[100010];
/*int T, N;
ll call_count, subtask_num, A[100000];
static void my_assert(int k){ if (!k) exit(1); }
void MinMax(long long s, long long t, long long *mn, long long *mx)
{
	int lo = 1, hi = N, left = N+1, right = 0;
	my_assert(s <= t && mn != NULL && mx != NULL);
	while (lo <= hi){
		int mid = (lo+hi)>>1;
		if (A[mid] >= s) hi = mid - 1, left = mid;
		else lo = mid + 1;
	}
	lo = 1, hi = N;
	while (lo <= hi){
		int mid = (lo+hi)>>1;
		if (A[mid] <= t) lo = mid + 1, right = mid;
		else hi = mid - 1;
	}
	if (left > right) *mn = *mx = -1;
	else{
		*mn = A[left];
		*mx = A[right];
	}
	if (subtask_num == 1) call_count++;
	else if (subtask_num == 2) call_count += right-left+2;
}*/


ll findGap(int T, int N)
{
    if(T==1)
    {
        int begg=0, endd=N-1;
        ll low_bound=0, up_bound=LONG_LONG_MAX;
        while(begg<=endd)
        {
            MinMax(low_bound, up_bound, &mn, &mx);
            niz[begg]=mn; niz[endd]=mx;
            //cout<<mn<<" "<<mx<<endl;
            begg++; endd--;
            low_bound=mn+1; up_bound=mx-1;
        }

        ll razlika=0;
        for(int i=0; i<N; i++)
        {razlika=max(razlika, niz[i+1]-niz[i]);}
        return razlika;
    }
}

/*int main()
{
    cin>>T>>N;
    for(int i=1; i<=N; i++)cin>>A[i];
    cout<<findGap(T, N);
}
/*1 2
1 3
4!!!!*/

컴파일 시 표준 에러 (stderr) 메시지

gap.cpp:65:1: warning: "/*" within comment [-Wcomment]
   65 | /*1 2
      |  
gap.cpp: In function 'll findGap(int, int)':
gap.cpp:57:1: warning: control reaches end of non-void function [-Wreturn-type]
   57 | }
      | ^

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