#include <bits/stdc++.h>
using namespace std;
deque<pair<long long,long long> > dq[201];
deque<int> id[201];
long long f(pair<long long,long long> line, long long x){
return line.first*x + line.second;
}
pair<long long,int> qry(long long x,int num){
while(dq[num].size()>1){
if(f(dq[num][0],x)<f(dq[num][1],x)){
dq[num].pop_front();
id[num].pop_front();
}
else break;
}
return make_pair(f(dq[num][0],x),id[num][0]);
}
long double intersect(long long m1, long long c1, long long m2, long long c2){
return (long double)(c2-c1)/(m1-m2);
}
long double intersect(pair<long long,long long> p1, pair<long long,long long> p2){
return intersect(p1.first,p1.second,p2.first,p2.second);
}
void ins(long long m,long long c,int index,int num) {//insert line y=mx+c
pair<long long,long long> line=make_pair(m,c);
while (dq[num].size()>1) {
long long s=dq[num].size();
if (intersect(dq[num][s-1],line)<=intersect(dq[num][s-2],line)){
dq[num].pop_back();
id[num].pop_back();
}
else break;
}
dq[num].push_back(line);
id[num].push_back(index);
}
long long n,k;
long long arr[100001],pre[100001];
int dp[100001][201];
bool vis[100001];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin>>n>>k;
for (int i=1;i<=n;i++) cin>>arr[i];
for (int i=1;i<=n;i++) pre[i]=pre[i-1]+arr[i];
for (int i=0;i<=k;i++){
ins(0,0,0,i);
}
long long ans=-1,pos=1;
for (int i=1;i<n;i++){
for (int j=k;j>=1;j--){
pair<long long,int> cur=qry(pre[i]-pre[n],j-1);
cur.first+=pre[i]*(pre[n]-pre[i]);
//dp[x][j-1].first+(pre[i]-pre[x])*(pre[n]-pre[i]);
ins(pre[i],cur.first,i,j);
dp[i][j]=cur.second;
assert(i!=cur.second);
if (j==k){
if (cur.first>=ans){
ans=cur.first;
pos=i;
}
}
}
}
cout<<ans<<'\n';
while (pos!=0 && k>0){
cout<<pos<<' ';
vis[pos]=true;
pos=dp[pos][k];
k--;
}
for (int i=1;i<n;i++){
if (k==0) break;
if (!vis[i]){
cout<<i<<' ';
k--;
}
}
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
596 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
1 ms |
596 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
1 ms |
596 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
1 ms |
600 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
1 ms |
604 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
1 ms |
596 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
1 ms |
604 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
1 ms |
596 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
1 ms |
588 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
1 ms |
604 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
1 ms |
596 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
1 ms |
596 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
1 ms |
596 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
1 ms |
596 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
1 ms |
596 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
1 ms |
600 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
1 ms |
596 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
596 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
1 ms |
596 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
1 ms |
596 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
1 ms |
596 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
1 ms |
596 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
1 ms |
604 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
1 ms |
604 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
1 ms |
608 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
1 ms |
600 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
1 ms |
596 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
724 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
1 ms |
728 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
2 ms |
980 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
2 ms |
728 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
2 ms |
856 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
3 ms |
852 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
2 ms |
860 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
1 ms |
732 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
1 ms |
724 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
1 ms |
724 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
1368 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
1 ms |
1364 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
8 ms |
1620 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
1 ms |
1364 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
9 ms |
1496 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
8 ms |
1496 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
11 ms |
1620 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
9 ms |
1616 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
3 ms |
1492 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
4 ms |
1492 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
5 ms |
8916 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
5 ms |
9056 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
87 ms |
9984 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
5 ms |
9044 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
59 ms |
9688 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
72 ms |
9340 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
78 ms |
9772 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
65 ms |
9936 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
63 ms |
9668 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
111 ms |
9668 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
46 ms |
83952 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
46 ms |
84060 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
936 ms |
93812 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
47 ms |
85136 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
1092 ms |
91960 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
716 ms |
87988 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
769 ms |
92656 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
632 ms |
91856 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
684 ms |
91692 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
880 ms |
92224 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
