#include <cstdio>
#include <utility>
#include <vector>
using namespace std;
typedef long long lint;
typedef pair<lint, int> pi;
struct cht{
int s,e;
lint la[100005],lb[100005];
int label[100005];
void insert(lint p, lint q, int piv){
la[e] = p;
lb[e] = q;
label[e] = piv;
while(e>1 && (lb[e-1] - lb[e-2]) * (la[e] - la[e-1]) <= (la[e-2] - la[e-1])* (lb[e-1] - lb[e])){
la[e-1] = la[e];
lb[e-1] = lb[e];
label[e-1] = label[e];
e--;
}
e++;
}
pi query(lint x){
while(s+1<e && lb[s+1] - lb[s] > x * (la[s] - la[s+1])) s++;
return pi(la[s]*x+lb[s],label[s]);
}
void clear(){s = e = 0;}
}convexHull;
int n,k;
lint dp[2][100005],a[100005];
int track[100005][205];
int main(){
int t;
scanf("%d %d",&n,&k);
for (int i=0; i<n; i++) {
scanf("%d",&t);
a[i+1] = a[i] + t;
}
lint sum = a[n];
for (int t=0; t<=k; t++) {
convexHull.clear();
dp[t%2][t] = -1e9;
convexHull.insert(a[t], dp[!(t%2)][t] - sum*a[t], t);
for (int i=t+1; i<=n; i++) {
pi x = convexHull.query(a[i]);
track[t][i] = x.second;
dp[t%2][i] = x.first + a[i] * (sum - a[i]);
convexHull.insert(a[i],dp[!(t%2)][i]-sum*a[i], i);
}
}
printf("%lld\n",dp[k%2][n]);
vector<int> res;
int pos2 = n;
for(int pos1 = k; pos1; pos1--){
res.push_back(track[pos1][pos2]);
pos2 = track[pos1][pos2];
}
while (!res.empty()) {
printf("%d ",res.back());
res.pop_back();
}
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
85584 KB |
Output is correct - contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
0 ms |
85584 KB |
Output is correct - contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
0 ms |
85584 KB |
Output is correct - contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
0 ms |
85584 KB |
Output is correct - contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
0 ms |
85584 KB |
Output is correct - contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
0 ms |
85584 KB |
Output is correct - contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
0 ms |
85584 KB |
Output is correct - contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
0 ms |
85584 KB |
Output is correct - contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
0 ms |
85584 KB |
Output is correct - contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
0 ms |
85584 KB |
Output is correct - contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
0 ms |
85584 KB |
Output is correct - contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
0 ms |
85584 KB |
Output is correct - contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
0 ms |
85584 KB |
Output is correct - contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
0 ms |
85584 KB |
Output is correct - contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
0 ms |
85584 KB |
Output is correct - contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
0 ms |
85584 KB |
Output is correct - contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
0 ms |
85584 KB |
Output is correct - contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
85584 KB |
Output is correct - contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
0 ms |
85584 KB |
Output is correct - contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
0 ms |
85584 KB |
Output is correct - contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
0 ms |
85584 KB |
Output is correct - contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
0 ms |
85584 KB |
Output is correct - contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
0 ms |
85584 KB |
Output is correct - contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
0 ms |
85584 KB |
Output is correct - contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
0 ms |
85584 KB |
Output is correct - contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
0 ms |
85584 KB |
Output is correct - contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
0 ms |
85584 KB |
Output is correct - contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
85584 KB |
Output is correct - contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
0 ms |
85584 KB |
Output is correct - contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
0 ms |
85584 KB |
Output is correct - contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
0 ms |
85584 KB |
Output is correct - contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
0 ms |
85584 KB |
Output is correct - contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
0 ms |
85584 KB |
Output is correct - contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
0 ms |
85584 KB |
Output is correct - contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
0 ms |
85584 KB |
Output is correct - contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
0 ms |
85584 KB |
Output is correct - contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
0 ms |
85584 KB |
Output is correct - contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
0 ms |
85584 KB |
Output isn't correct - declared answer doesn't correspond to the split scheme: declared = 21503404, real = 21358818 |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Halted |
0 ms |
0 KB |
- |
