#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; gp.push_back(0);
for(int i=0; i<k-1; i++) gp.push_back(v[i+1]-v[i]-1);
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()-1;
int g2 = n-v.back();
int res = 0;
int lim = gp.size()-1;
res = max(res, gp[min((d )/2, lim)]);
if(d >= 2) res = max(res, gp[min((d-2)/2, lim)]+g1+g2);
res = max(res, gp[min((d-1)/2, lim)]+max(g1, g2));
cout << res << endl;
return 0;
}
Compilation message
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];
^
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
0 ms |
2020 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
0 ms |
2020 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
0 ms |
2020 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
63 ms |
3264 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
63 ms |
3264 KB |
Output is correct |
2 |
Correct |
59 ms |
3264 KB |
Output is correct |
3 |
Incorrect |
56 ms |
3264 KB |
Output isn't correct |
4 |
Halted |
0 ms |
0 KB |
- |