#include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define pii pair<LL,LL>
#define LL long long
#define st first
#define nd second
#define endl '\n'
using namespace std;
const int MAXN=100005,MAXK=201;
LL n,k,sum[MAXN],t,pnt[MAXK],val[MAXK];
int used[MAXN][MAXK];
vector<pair<pii,int> > line[MAXK];
double inter(pii a,pii b) {
if(a.st==b.st)
return -1e9;
return 1.0*(b.nd-a.nd)/(a.st-b.st);
}
void upd(int x,LL val) {
while(pnt[x]+1<line[x].size()&&inter(line[x][pnt[x]].st,line[x][pnt[x]+1].st)<=1.0*val)
++pnt[x];
}
void add(int x,pii ll,int y) {
while(line[x].size()>=2&&inter(line[x].back().st,line[x][line[x].size()-2].st)>=inter(ll,line[x].back().st))
line[x].pop_back();
line[x].pb(mp(ll,y));
pnt[x]=min(pnt[x],(LL)line[x].size()-1);
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin>>n>>k;
for(int i=1;i<=n;++i) {
cin>>t;
sum[i]=sum[i-1]+t;
}
for(int i=1;i<=n;++i) {
for(int j=1;j<min((LL)i,k+1);++j){
upd(j-1,sum[i]);
val[j]=line[j-1][pnt[j-1]].st.st*sum[i]+line[j-1][pnt[j-1]].st.nd;
//cout<<i<<" "<<j<<" "<<val[j]<<" "<<line[j-1][pnt[j-1]].nd<<" "<<sum[i]<<" "<<-sum[i]*sum[i]+val[j]<<endl;
used[i][j]=line[j-1][pnt[j-1]].nd;
}
for(int j=1;j<min((LL)i,k+1);++j)
add(j,mp(sum[i],-sum[i]*sum[i]+val[j]),i);
add(0,mp(sum[i],-sum[i]*sum[i]),i);
}
cout<<val[k]<< endl;
int cur=n;
for(int i=k;i>=1;--i) {
cur=used[cur][i];
cout<<cur<<" ";
}
cout<<endl;
}
Compilation message
sequence.cpp: In function 'void upd(int, long long int)':
sequence.cpp:26:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
while(pnt[x]+1<line[x].size()&&inter(line[x][pnt[x]].st,line[x][pnt[x]+1].st)<=1.0*val)
^
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
81488 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
0 ms |
81488 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
0 ms |
81488 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
0 ms |
81488 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
0 ms |
81488 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
0 ms |
81488 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
0 ms |
81488 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
0 ms |
81488 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
0 ms |
81488 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
0 ms |
81488 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
0 ms |
81488 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
0 ms |
81488 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
0 ms |
81488 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
0 ms |
81488 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
0 ms |
81488 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
0 ms |
81488 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
0 ms |
81488 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
81488 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
0 ms |
81488 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
0 ms |
81488 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
0 ms |
81488 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
0 ms |
81488 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
0 ms |
81488 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
0 ms |
81488 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
0 ms |
81488 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
0 ms |
81488 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
0 ms |
81488 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
81488 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
0 ms |
81488 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
0 ms |
82152 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
0 ms |
81488 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
0 ms |
82016 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
0 ms |
82020 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
0 ms |
82152 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
0 ms |
81756 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
0 ms |
81620 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
0 ms |
81752 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
81624 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
0 ms |
81636 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
13 ms |
86308 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
0 ms |
81636 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
6 ms |
86596 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
3 ms |
85760 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
13 ms |
86592 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
9 ms |
86308 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
0 ms |
82600 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
0 ms |
83556 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
82584 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
3 ms |
82584 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Memory limit exceeded |
109 ms |
131072 KB |
Memory limit exceeded |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
29 ms |
95364 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
43 ms |
95364 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Memory limit exceeded |
103 ms |
131072 KB |
Memory limit exceeded |
| 4 |
Halted |
0 ms |
0 KB |
- |
