# include <iostream>
# include <set>
using namespace std;
const int N = 1e5 + 100;
set < pair < int, int > > blocks[111];
int n, k;
int a[N];
int l[111], r[111];
long long ans;
int getMax(int i)
{
return -(blocks[i].begin() -> first);
}
int main()
{
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = 1; i <= k; i++){
blocks[i].insert({-a[i], i});
l[i] = i;
r[i] = i;
}
for (int i = k + 1; i <= n; i++){
r[k]++;
blocks[k].insert({-a[i], i});
for (int j = k - 1; j >= 1; j--){
if(r[j + 1] != l[j + 1] && a[l[j + 1]] <= getMax(j)){
blocks[j + 1].erase({-a[l[j + 1]], l[j + 1]});
blocks[j].insert({-a[l[j + 1]], l[j + 1]});
l[j + 1]++;
r[j]++;
}
}
}
for (int i = 1; i <= k; i++){
ans += getMax(i);
}
cout << ans;
}
/*
5 2
5 4 3 1 2
*/
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
376 KB |
Output is correct |
2 |
Correct |
2 ms |
376 KB |
Output is correct |
3 |
Correct |
2 ms |
248 KB |
Output is correct |
4 |
Correct |
2 ms |
376 KB |
Output is correct |
5 |
Correct |
2 ms |
376 KB |
Output is correct |
6 |
Correct |
2 ms |
376 KB |
Output is correct |
7 |
Correct |
2 ms |
376 KB |
Output is correct |
8 |
Correct |
2 ms |
256 KB |
Output is correct |
9 |
Incorrect |
2 ms |
376 KB |
Output isn't correct |
10 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
376 KB |
Output is correct |
2 |
Correct |
2 ms |
256 KB |
Output is correct |
3 |
Correct |
2 ms |
376 KB |
Output is correct |
4 |
Correct |
2 ms |
376 KB |
Output is correct |
5 |
Correct |
2 ms |
376 KB |
Output is correct |
6 |
Correct |
2 ms |
252 KB |
Output is correct |
7 |
Correct |
2 ms |
376 KB |
Output is correct |
8 |
Correct |
2 ms |
376 KB |
Output is correct |
9 |
Incorrect |
2 ms |
252 KB |
Output isn't correct |
10 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
2 ms |
256 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
7 ms |
888 KB |
Output is correct |
2 |
Correct |
22 ms |
2936 KB |
Output is correct |
3 |
Correct |
23 ms |
2824 KB |
Output is correct |
4 |
Incorrect |
26 ms |
2936 KB |
Output isn't correct |
5 |
Halted |
0 ms |
0 KB |
- |