제출 #26824

#제출 시각아이디문제언어결과실행 시간메모리
26824szawinis구경하기 (JOI13_watching)C++14
100 / 100
276 ms17828 KiB
#include <bits/stdc++.h>
using namespace std;
const int MAX = (2e3)+1, INF = 1e8;

int n, p, q, a[MAX], dp[MAX][MAX];
bool check(int len) {
	for(int i = 1, x = 1, y = 1; i <= n; i++) {
		while(a[i] - a[x] + 1 > len) x++;
		while(a[i] - a[y] + 1 > 2*len) y++;
		for(int j = 0; j <= min(p, n); j++) dp[i][j] = dp[y-1][j] + 1;
		for(int j = 1; j <= min(p, n); j++) dp[i][j] = min(dp[x-1][j-1], dp[i][j]);
	}
	bool ret = false;
	for(int j = 0; j <= min(p, n); j++) ret |= dp[n][j] <= q;
	return ret;
}
int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	cin >> n >> p >> q;
	for(int i = 1; i <= n; i++) cin >> a[i];
	sort(a+1, a+n+1);
	int l = 1, r = 1e9;
	while(l < r) {
		int mid = l+r >> 1;
		if(check(mid)) r = mid;
		else l = mid+1;
	}
	cout << l;
}

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

watching.cpp: In function 'int main()':
watching.cpp:25:14: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   int mid = l+r >> 1;
              ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...