#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll dp[100001][202]={0};
ll pref[100001]={0};
ll p[100001][202];
int main(){
// cin.tie(0)->sync_with_stdio(0);
int n, k; cin >> n >> k;
vector<ll> a(n);
for(int i=0;i<n;i++)cin >> a[i];
for(int i=0;i<n;i++)pref[i+1]=pref[i]+a[i];
for(int j=1;j<=k+1;j++){
for(int i=1;i<=n;i++){ //maak i = 0
for(int x=0;x<i;x++){
if(dp[x][j-1]+(pref[i]-pref[x])*(pref[n]-pref[i])>=dp[i][j]){
dp[i][j]=dp[x][j-1]+(pref[i]-pref[x])*(pref[n]-pref[i]);
p[i][j]=x;
}
}
// cout << '(' << i << ' ' << j << ')' << dp[i][j] << ' ' << p[i][j] << ' ';
}
// cout << '\n';
}
cout << dp[n][++k] << '\n';
int sus=p[n][k--];
while(sus>0){
cout << sus << ' ';
sus=p[sus][k--];
}
return 0;
// 7 3
// 4 1 3 4 0 2 3
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 108 == 108 |
2 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 999 == 999 |
3 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 0 == 0 |
4 |
Correct |
1 ms |
348 KB |
contestant found the optimal answer: 1542524 == 1542524 |
5 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
6 |
Incorrect |
0 ms |
344 KB |
Extra information in the output file |
7 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
600 KB |
contestant found the optimal answer: 1093956 == 1093956 |
2 |
Correct |
1 ms |
604 KB |
contestant found the optimal answer: 302460000 == 302460000 |
3 |
Correct |
1 ms |
604 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
4 |
Correct |
1 ms |
604 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
5 |
Correct |
1 ms |
604 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
6 |
Correct |
1 ms |
604 KB |
contestant found the optimal answer: 933702 == 933702 |
7 |
Correct |
1 ms |
600 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
8 |
Incorrect |
0 ms |
604 KB |
Extra information in the output file |
9 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
860 KB |
contestant found the optimal answer: 610590000 == 610590000 |
2 |
Correct |
1 ms |
956 KB |
contestant found the optimal answer: 311760000 == 311760000 |
3 |
Correct |
5 ms |
2908 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
4 |
Correct |
1 ms |
860 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
5 |
Correct |
4 ms |
2908 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
6 |
Correct |
5 ms |
860 KB |
contestant found the optimal answer: 107630884 == 107630884 |
7 |
Correct |
5 ms |
856 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
8 |
Incorrect |
2 ms |
856 KB |
Extra information in the output file |
9 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
4 ms |
4188 KB |
contestant found the optimal answer: 21503404 == 21503404 |
2 |
Correct |
5 ms |
4188 KB |
contestant found the optimal answer: 140412195 == 140412195 |
3 |
Correct |
106 ms |
3416 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
4 |
Correct |
4 ms |
3420 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
5 |
Correct |
121 ms |
3668 KB |
contestant found the optimal answer: 679388326 == 679388326 |
6 |
Correct |
92 ms |
3416 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
7 |
Correct |
107 ms |
4268 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
8 |
Incorrect |
107 ms |
3616 KB |
Extra information in the output file |
9 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
534 ms |
32840 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
2 |
Correct |
542 ms |
32216 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
3 |
Execution timed out |
2093 ms |
32120 KB |
Time limit exceeded |
4 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Execution timed out |
2069 ms |
108860 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |