Submission #20899

#	Time	Username	Problem	Language	Result	Execution time	Memory
20899		exqt	격자 보존하기 (GA9_preserve)	C++14	0 / 100	59 ms	3264 KiB

preserve

#include <iostream>
#include <algorithm>
#include <vector>
#include <utility>
#include <string>
#include <set>
#include <ctime>

using namespace std;


int main()
{
	int n, k, d; cin >> n >> k >> d;
	vector<int> v(k);
	for(int i=0; i<k; i++) cin >> v[i];

	vector<int> gp;
	for(int i=0; i<k-1; i++) gp.push_back(max(v[i+1]-v[i]-1, 0));

	sort(gp.begin(), gp.end());
	reverse(gp.begin(), gp.end());

	for(int i=1; i<gp.size(); i++) gp[i] += gp[i-1];

	int g1 = v.front();
	int g2 = n-v.back();

	int res = max(g1, g2);
	int lim = gp.size(); lim = max(lim-1, 0);

	if(d >= 2) res = max(res, gp[min(d/2-1, lim)]);
	if(d >= 4) res = max(res, gp[min((d-2)/2-1, lim)]+g1+g2);
	if(d >= 3) res = max(res, gp[min((d-1)/2-1, lim)]+g1);
	if(d >= 3) res = max(res, gp[min((d-1)/2-1, lim)]+g2);

	cout << res << endl;

    return 0;
}

Compilation message (stderr)

preserve.cpp: In function 'int main()':
preserve.cpp:24:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=1; i<gp.size(); i++) gp[i] += gp[i-1];
                ^

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