Submission #12772

#	Time	Username	Problem	Language	Result	Execution time	Memory
12772		Qwaz	격자 보존하기 (GA9_preserve)	C++98	100 / 100	32 ms	2372 KiB

preserve

#include <cstdio>
#include <vector>
#include <algorithm>

using namespace std;

const int MAX = 100020;

int n, d, k, data[MAX];

void input(){
	scanf("%d%d%d", &n, &k, &d);

	for(int i = 0; i < k; i++)
		scanf("%d", &data[i]);
}

vector < int > gap;

int res;

void solve(){
	int front = data[0]-1, rear = n-data[k-1];

	for(int i = 1; i < k; i++)
		gap.push_back(data[i]-data[i-1]-1);

	sort(gap.begin(), gap.end());

	if(d >= 1){
		res = max(res, front);
		res = max(res, rear);
	}

	if(d >= 2)
		res = max(res, front+rear);

	int index = k-2, current = 0;
	while(index >= 0 && d >= 2){
		d -= 2;
		current += gap[index--];

		res = max(res, current);

		if(d >= 1){
			res = max(res, current+front);
			res = max(res, current+rear);
		}

		if(d >= 2)
			res = max(res, current+front+rear);
	}

	printf("%d\n", res);
}

int main(){
	input();

	solve();

	return 0;
}

• Subtask 1: 9 / 9
• Subtask 2: 17 / 17
• Subtask 3: 22 / 22
• Subtask 4: 17 / 17
• Subtask 5: 35 / 35