#include <bits/stdc++.h>
#pragma GCC optimize("O3")
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--)
#define double long double
using namespace std;
ll dp[100002][2];
int ans[100002][202];
ll suff[100002];
double slope(ll a, ll b){
if (suff[b] == suff[a]){
if ((double)dp[a][0] - (double)dp[b][0] <= 0) return 1000000000000;
}
return ((double)dp[a][0] - (double)dp[b][0]) / ((double)suff[b] - (double)suff[a]);
}
bool case1(ll a, ll b, ll i){
return (dp[a][0] - dp[b][0]) <= (suff[b] - suff[a])*suff[i];
}
bool case2(ll a, ll b, ll i){
return (dp[a][0] - dp[b][0]) * (suff[i] - suff[b]) <= (dp[b][0] - dp[i][0]) * (suff[b] - suff[a]);
}
int main(){
ll n,k;
cin >> n >> k;
vector<ll> nums(n);
FOR(i,0,n) cin >> nums[i];
suff[n] = 0;
suff[n-1] = nums[n-1];
FORNEG(i,n-2,-1){
suff[i] = suff[i+1] + nums[i];
}
FOR(i,0,n+1){
dp[i][0] = 0;
}
FOR(j,1,k+2){
deque<ll> q;
q.push_back(0);
FOR(i,1,n+1){
//cout << q[0] << " " << q[1] << " " << slope(q[0], q[1], j) << " " << suff[i] << endl;
while (q.size() >= 2 && case1(q[0], q[1], i)){
q.pop_front();
}
ll tmp = q.front();
dp[i][1] = dp[tmp][0] + (suff[tmp]-suff[i])*suff[i];
ans[i][j] = tmp;
//cout << tmp << " " << maxpos << endl;
//cout << endl;
while (q.size() >=2 && case2(q[q.size()-2], q[q.size()-1], i)){
q.pop_back();
}
q.push_back(i);
}
FOR(i,1,n+1){
dp[i][0] = dp[i][1];
}
}
cout << dp[n][1] << "\n";
// FOR(i,0,n+1){
// FOR(j,0,k+2){
// cout << dp[i][j] << " ";
// }
// cout << endl;
// }
ll sus = n;
vector<ll> sussy;
FOR(i,0,k){
sus = ans[sus][k-i+1];
cout << sus << " ";
}
}
| # |
Verdict |
Execution time |
Memory |
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 |
212 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
1 ms |
304 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
1 ms |
212 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
1 ms |
212 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
1 ms |
308 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
1 ms |
304 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
1 ms |
212 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
1 ms |
344 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
1 ms |
212 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
1 ms |
308 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
1 ms |
212 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
1 ms |
308 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
1 ms |
212 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
1 ms |
212 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
1 ms |
316 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
1 ms |
340 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
432 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
1 ms |
436 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
1 ms |
468 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
1 ms |
468 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
1 ms |
436 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
1 ms |
468 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
1 ms |
468 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
1 ms |
436 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
1 ms |
432 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
1 ms |
436 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
1108 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
1 ms |
1108 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
5 ms |
1108 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
1 ms |
1076 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
5 ms |
1108 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
6 ms |
1148 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
6 ms |
1160 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
4 ms |
1108 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
2 ms |
1108 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
3 ms |
1108 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
6 ms |
8532 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
6 ms |
8532 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
43 ms |
8532 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
7 ms |
8556 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
41 ms |
8532 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
46 ms |
8568 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
49 ms |
8532 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
30 ms |
8620 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
38 ms |
8588 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
45 ms |
8508 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
55 ms |
82944 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
60 ms |
83024 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
536 ms |
83140 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
65 ms |
83148 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
649 ms |
82992 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
472 ms |
83036 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
488 ms |
83148 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
383 ms |
83104 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
391 ms |
83084 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
483 ms |
83152 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
