///* __ __ __ */
///* ====== _ /| /| __ _ / | | /| | * | | | | / /| |\ | / | | * | / */
///* \- || |_| |_ / |/ | | | |_ |- | |--| /-| | | \ \ |==| |- /=| | \ | | |--| | |- */
///* || | | |_ / | |__| _| |_ \__ | | / | |__ | __| | | | \ / | | \| \__ | | | | \ */
///*
// autor :: Rick Prime
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define ff first
#define ss second
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define int long long
typedef vector<int> vi;
typedef vector<double> vd;
typedef pair<int,int> pii;
typedef vector<pii> vii;
const int N = 2e5+50, inf = 1e18, mod = 1e9+7;
void solve(){
int n, k;
cin >> n >> k;
int dp[n][k+1];
memset(dp, 0, sizeof(dp));
int a[n];
for(int &i:a)cin >> i;
int sf[n+1]{};
for(int i = n-1; i >= 0; i--){
sf[i] = a[i]+sf[i+1];
}
int pr[n][k];
int ans = 0, ps = 0;
for(int i = 0; i < n; i++){
int sm = 0;
for(int j = i-1; j >= 0; j--){
sm = sf[j]-sf[i];
for(int x = 0; x < k; x++){
//dp[j][x] + sm*sf[i]
//dp[i][x+1]
if(dp[i][x+1] < dp[j][x] + sm*sf[i]){
pr[i][x+1] = j;
dp[i][x+1] = dp[j][x] + sm*sf[i];
}
}
}
if(dp[i][k] >= ans){
ps = i;
ans = dp[i][k];
}
}
cout << ans << '\n';
//for(int i = 0; i <= k; i++){
//for(int j = 0; j < n; j++){
//cout << dp[j][i] << ' ';
//}cout << '\n';
//}
vi v;
while(k){
v.pb(ps);
ps = pr[ps][k--];
}reverse(all(v));
for(auto i:v)cout << i << ' ';
cout << '\n';
}
signed main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int tt = 1;
//cin >> tt;
while (tt--) {
solve();
}
}
| # |
Verdict |
Execution time |
Memory |
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 |
1 ms |
348 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
0 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 |
1 ms |
348 KB |
declared answer doesn't correspond to the split scheme: declared = 7, real = 1 |
| 7 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
348 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
1 ms |
460 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
1 ms |
348 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
1 ms |
348 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
0 ms |
348 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
1 ms |
348 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
348 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
1 ms |
348 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
3 ms |
860 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
1 ms |
348 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
3 ms |
860 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
3 ms |
860 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
4 ms |
1080 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
1 ms |
348 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
1 ms |
348 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
1 ms |
632 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
348 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
2 ms |
348 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
77 ms |
3568 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
2 ms |
344 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
76 ms |
3576 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
66 ms |
3104 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
73 ms |
3604 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
75 ms |
3672 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
19 ms |
860 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
33 ms |
1728 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
219 ms |
1132 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
179 ms |
1136 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Execution timed out |
2061 ms |
31836 KB |
Time limit exceeded |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
2032 ms |
7260 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
