제출 #50996

#제출 시각아이디문제언어결과실행 시간메모리
50996alenam0161Gap (APIO16_gap)C++17
0 / 100
70 ms3116 KiB
#include "gap.h"
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
long long findGap(int T, int N)
{
	if (N == 0)return 0;
	long long ans = 0;
	long long inf = 1e18 + 1;
	long long  fi=-1;
	long long   se=inf;
	vector<long long> a, b;
	while (true) {
		MinMax(fi, se, &fi, &se);
		if (fi == -1 || se == -1)break;
		if(fi!=-1)
		a.push_back(fi);
		if(se!=-1)
		b.push_back(se);
		fi++;
		se--;
		if (fi >= se)break;
	}
	for (int i = b.size() - 1; i >= 0; i--)a.push_back(b[i]);
	for (int i = 1; i < a.size(); ++i) {
		ans = max(ans, a[i] - a[i - 1]);
	}
	return ans;
}

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

gap.cpp: In function 'long long int findGap(int, int)':
gap.cpp:26:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 1; i < a.size(); ++i) {
                  ~~^~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...