#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define all(a) a.begin(),a.end()
#define mp make_pair
#define fi first
#define se second
#define sz(a) (int)a.size()
using ll = long long;
const int maxn = (int)1e5+10;
const ll INF = (ll)2e18;
ll n, K, a[maxn], s[maxn];
ll dp[2][maxn];
int p[205][maxn];
vector<int> v;
void recur(int i, int k){ if(k) v.pb(i), recur(p[k][i],k-1); }
double slope(int i, int j, int k){
if(s[j]==s[i]) return INF;
return (double)((dp[k][j]-s[n]*s[j])-(dp[k][i]-s[n]*s[i]))/(s[j]-s[i]);
}
int32_t main()
{
ios_base::sync_with_stdio(false); cin.tie(0);
cin >> n >> K; int ind = 0;
for(int i = 0; i < n; i++) cin >> a[i], s[i+1]=s[i]+a[i];
for(int k = 1; k <= K+1; k++){
deque<int> DQ; DQ.clear(); DQ.push_back(0); ind = k%2;
for(int i = 1; i <= n; i++){
while(sz(DQ)>1 and slope(DQ[0],DQ[1],!ind)>= -s[i]) DQ.pop_front();
int j = DQ[0]; dp[ind][i]=dp[!ind][j]+(s[i]-s[j])*(s[n]-s[i]), p[k][i]=j;
while(sz(DQ)>1 and slope(DQ[sz(DQ)-2], DQ.back(),!ind) <= slope(DQ.back(),i,!ind)) DQ.pop_back();
DQ.push_back(i);
}
memcpy(dp[!ind],dp[ind],sizeof(dp[ind]));
}
cout << dp[ind][n] << "\n"; recur(n,K+1);
sort(all(v)); v.pop_back(); for(auto u : v) cout << u << " ";
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
1 ms |
1804 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
2 ms |
1876 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
1 ms |
1860 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
1 ms |
1864 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
1 ms |
1868 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
2 ms |
2132 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
2 ms |
1876 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
2 ms |
2004 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
2 ms |
1876 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
1 ms |
1864 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
2 ms |
1876 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
7 ms |
3028 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
6 ms |
2644 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
7 ms |
2900 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
8 ms |
3028 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
3 ms |
2004 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
2 ms |
2016 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
3 ms |
2132 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
1876 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
1 ms |
1876 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
13 ms |
3540 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
2 ms |
1876 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
15 ms |
3596 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
12 ms |
3344 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
14 ms |
3560 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
12 ms |
3540 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
4 ms |
2132 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
6 ms |
2516 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
2132 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
3 ms |
2260 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
71 ms |
10944 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
3 ms |
2260 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
55 ms |
7360 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
57 ms |
8296 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
67 ms |
8708 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
53 ms |
7488 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
55 ms |
8308 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
70 ms |
10084 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
20 ms |
5076 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
21 ms |
5332 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
643 ms |
82656 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
20 ms |
5708 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
824 ms |
82448 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
552 ms |
58920 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
624 ms |
63052 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
454 ms |
52040 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
483 ms |
59084 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
611 ms |
74784 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
