#include <vector>
#include <bits/stdc++.h>
typedef long long ll;
#define FOR(i,x,y) for(ll i=x; i<y; i++)
#define FORNEG(i,x,y) for(ll i=x; i>y; i--)
using namespace std;
ll dp[1001][201];
ll prevs[1001][201];
int main(){
ll n,k;
cin >> n >> k;
vector<ll> arr(n);
vector<ll> pref(n);
FOR(i,0,n) cin >> arr[i];
pref[0] = arr[0];
FOR(i,1,n) pref[i] = pref[i-1]+arr[i];
FOR(i,0,1001)FOR(j,0,201) dp[i][j] = -10000000;
deque<vector<ll>> sus;
dp[0][0] = 0;
FOR(j,1,k+1){
FOR(i,1,n+1){
FOR(m,0, i){
ll temp = dp[m][j-1] + (pref[n-1] - pref[i-1]) * (pref[i-1]-pref[m]+arr[m]);
if (dp[i][j] < temp){
dp[i][j] = temp;
prevs[i][j] = m;
}
}
}
}
ll maxi = -1;
ll pos = -1;
FOR(i,0,n) if (dp[i][k] > maxi) maxi = dp[i][k], pos = i;
cout << dp[pos][k] << endl;
while (pos != 0){
ll sus = prevs[pos][k];
k--;
cout << pos << " ";
pos = sus;
}
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
3416 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
1 ms |
3420 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
1 ms |
3208 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
1 ms |
3420 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
1 ms |
3420 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
1 ms |
3420 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
1 ms |
3420 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
1 ms |
3420 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
1 ms |
3420 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
1 ms |
3420 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
1 ms |
3420 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
1 ms |
3420 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
1 ms |
3420 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
1 ms |
3420 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
1 ms |
3420 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
1 ms |
3420 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
1 ms |
3420 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
3420 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
1 ms |
3420 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
1 ms |
3420 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
1 ms |
3420 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
1 ms |
3420 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
1 ms |
3420 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
1 ms |
3420 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
1 ms |
3420 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
1 ms |
3420 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
1 ms |
3420 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
3420 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
1 ms |
3420 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
6 ms |
3420 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
1 ms |
3420 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
4 ms |
3420 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
6 ms |
3660 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
5 ms |
3420 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
2 ms |
3420 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
1 ms |
3420 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
2 ms |
3592 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
4 ms |
3420 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
3 ms |
3420 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
120 ms |
3576 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
3 ms |
3420 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
123 ms |
3420 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
106 ms |
3580 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
120 ms |
3572 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
117 ms |
3416 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
25 ms |
3420 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
53 ms |
3420 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Runtime error |
5 ms |
7004 KB |
Execution killed with signal 11 |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Runtime error |
13 ms |
10076 KB |
Execution killed with signal 11 |
| 2 |
Halted |
0 ms |
0 KB |
- |
