#include<bits/stdc++.h>
#define lf double
#define ll long long
#define cc pair<char,char>
#define ull unsigned ll
#define ii pair<int,int>
#define li pair<ll,int>
#define iii pair<int,ii>
#define iiii pair<ii,ii>
#define iiii2 pair<int,iii>
#define lii pair<ll,ii>
#define lolo pair<ll,ll>
#define heap priority_queue
#define mp make_pair
#define st first
#define nd second
#define pb push_back
#define pf push_front
#define ppb pop_back
#define ppf pop_front
#define all(x) x.begin(),x.end()
#define len(x) strlen(x)
#define sz(x) (int) x.size()
#define orta ((bas+son)/2)
#define min3(x,y,z) min(min(x,y),z)
#define max3(x,y,z) max(max(x,y),z)
#define umin(x,y) x=min(x,y)
#define umax(x,y) x=max(x,y)
#define dbgs(x) cerr<<(#x)<<" --> "<<(x)<<" "
#define dbg(x) cerr<<(#x)<<" --> "<<(x)<<endl;getchar()
#define MOD 1000000000
#define inf 1000000000000000000ll
#define N 100005
#define LOG 20
#define magic 100
#define KOK 250
#define EPS 0.0025
#define pw(x) (1<<(x))
#define PI 3.1415926535
#define loloi pair<lolo,int>
using namespace std;
int n,k,x,ptr;
ll dp[2][N],pre[N];
int tut[201][100001];
vector<loloi> v;
ll res(lolo line,ll x) {
return line.st*x+line.nd;
}
ll get(ll val) {
while(ptr+1<sz(v) && res(v[ptr].st,val)<res(v[ptr+1].st,val)) ptr++;
return res(v[ptr].st,val);
}
lf inter(lolo line1,lolo line2) {
return 1.0*(line2.nd-line1.nd)/(line1.st-line2.st);
}
void up(ll a,ll b,int ind) {
while(sz(v)>1 && inter({a,b},v[sz(v)-1].st)<=inter({a,b},v[sz(v)-2].st)) {
v.ppb();
}
v.pb({{a,b},ind});
ptr=min(ptr,sz(v)-1);
}
void clear() {
ptr=0;
v.clear();
}
int main() {
#if 0
freopen("input.txt","r",stdin);
#endif
scanf("%d %d",&n,&k);
for(int i=1;i<=n;i++) {
scanf("%d",&x);
pre[i]=pre[i-1]+x;
}
for(int i=1;i<=k;i++) {
clear();
up(pre[i],-pre[i]*pre[i]+dp[0][i],i);
for(int j=i+1;j<=n;j++) {
dp[1][j]=get(pre[j]);
tut[i][j]=v[ptr].nd;
up(pre[j],-pre[j]*pre[j]+dp[0][j],j);
dp[0][j]=dp[1][j];
}
}
printf("%lld\n",dp[0][n]);
for(int i=tut[k][n];i>=1;i=tut[k][i]) {
k--;
printf("%d ",i);
}
assert(k==0);
}
Compilation message
sequence.cpp: In function 'int main()':
sequence.cpp:96:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d %d",&n,&k);
~~~~~^~~~~~~~~~~~~~~
sequence.cpp:100:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d",&x);
~~~~~^~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
2 ms |
488 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
2 ms |
544 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
2 ms |
544 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
3 ms |
544 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
2 ms |
544 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
3 ms |
640 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
2 ms |
640 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
3 ms |
640 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
2 ms |
640 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
2 ms |
640 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
3 ms |
640 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
3 ms |
640 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
3 ms |
640 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
2 ms |
640 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
2 ms |
640 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
2 ms |
644 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
648 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
3 ms |
648 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
2 ms |
860 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
2 ms |
860 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
2 ms |
860 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
2 ms |
860 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
2 ms |
860 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
2 ms |
860 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
2 ms |
860 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
2 ms |
860 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
860 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
2 ms |
860 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
3 ms |
1716 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
2 ms |
1716 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
3 ms |
1716 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
3 ms |
1716 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
3 ms |
1716 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
3 ms |
1716 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
3 ms |
1716 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
3 ms |
1716 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
1716 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
2 ms |
1716 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
8 ms |
2364 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
2 ms |
2364 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
9 ms |
2364 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
10 ms |
2364 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
9 ms |
2368 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
9 ms |
2492 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
3 ms |
2492 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
5 ms |
2492 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
5 ms |
2492 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
4 ms |
2492 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
68 ms |
9936 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
5 ms |
9936 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
49 ms |
9936 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
61 ms |
9936 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
58 ms |
9936 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
45 ms |
9936 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
54 ms |
9936 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
65 ms |
9936 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
29 ms |
9936 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
26 ms |
9936 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
583 ms |
83692 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
25 ms |
83692 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
798 ms |
83692 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
595 ms |
83692 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
604 ms |
83692 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
420 ms |
83692 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
463 ms |
83692 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
625 ms |
83692 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
