#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
const int N = 1e5 + 3;
const ll INF = 2e12 + 3;
int n, k;
ll dp[N][203], p[N];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n >> k;
for(int i = 1; i <= n; ++i){
ll a;
cin >> a;
p[i] = p[i - 1] + a;
}
for(int i = 1; i <= n; ++i){
for(int j = 1; j < i; ++j){
for(int t = 1; t < i; ++t){
dp[i][j] = max(dp[i][j], dp[t][j - 1] + p[t] * (p[i] - p[t]));
}
}
}
ll cur = dp[n][k];
cout << cur << "\n";
int poi = n - 1, end = n, cnt = k - 1;
for(; poi >= 1; --poi){
if(dp[poi][cnt] + p[poi] * (p[end] - p[poi]) == dp[end][cnt + 1]){
cout << poi << " ";
end = poi;
cnt--;
}
}
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 108 == 108 |
2 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 999 == 999 |
3 |
Correct |
1 ms |
324 KB |
contestant found the optimal answer: 0 == 0 |
4 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 1542524 == 1542524 |
5 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
6 |
Incorrect |
0 ms |
340 KB |
Extra information in the output file |
7 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
1 ms |
340 KB |
Extra information in the output file |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
4 ms |
636 KB |
contestant found the optimal answer: 610590000 == 610590000 |
2 |
Correct |
4 ms |
584 KB |
contestant found the optimal answer: 311760000 == 311760000 |
3 |
Correct |
4 ms |
596 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
4 |
Correct |
4 ms |
576 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
5 |
Correct |
4 ms |
596 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
6 |
Incorrect |
4 ms |
588 KB |
Extra information in the output file |
7 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
495 ms |
1972 KB |
Unexpected end of file - int32 expected |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Execution timed out |
2066 ms |
3124 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Execution timed out |
2039 ms |
3764 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |