#include<bits/stdc++.h>
using namespace std;
#define scl(x) scanf("%lld",&x)
#define sc(x) scanf("%d",&x)
#define ll long long
#define lop(i,n) for(int i=0;i<n;++i)
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
const int N=1e5+10,K=202;
ll dp[N][K],p[N];
int cut[N][K];
int n,k;
void solve(int s,int e,int l,int r,int rem){
if(e<s)return;
int m=s+((e-s)>>1);
int opt=m;
dp[m][rem]=-1e18;
for(int i=max(l,m);i<=r;i++){
ll res=(p[i]-p[m-1])*p[m-1]+dp[i+1][rem-1];
if(res>dp[m][rem]){
dp[m][rem]=res;
opt=i;
}
}
cut[m][rem]=opt;
solve(s,m-1,l,opt,rem);
solve(m+1,e,opt,r,rem);
}
int main(){
#ifndef ONLINE_JUDGE
//freopen("i.txt","r",stdin);
#endif
sc(n),sc(k);k++;
for(int i=1;i<=n;i++)
scl(p[i]),p[i]+=p[i-1];
for(int i=0;i<=n;i++)
dp[i][0]=-1e18;
dp[n+1][0]=0;
for(int rem=1;rem<=k;rem++)
solve(1,n,1,n,rem);
printf("%lld\n",dp[1][k]);
int cur=1,rem=k;
while(cur<=n&&cut[cur][rem]!=n){
printf("%d",cut[cur][rem]);
cur=cut[cur][rem]+1;
rem--;
if(cur<=n)printf(" ");
}
puts("");
}
Compilation message
sequence.cpp: In function 'int main()':
sequence.cpp:35:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
sc(n),sc(k);k++;
^
sequence.cpp:35:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
sequence.cpp:37:12: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scl(p[i]),p[i]+=p[i-1];
^
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
380 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
2 ms |
452 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
2 ms |
452 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
2 ms |
472 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
2 ms |
476 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
2 ms |
476 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
2 ms |
652 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
2 ms |
652 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
2 ms |
652 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
2 ms |
652 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
2 ms |
652 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
2 ms |
652 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
2 ms |
652 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
2 ms |
652 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
2 ms |
652 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
2 ms |
652 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
2 ms |
724 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
784 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
2 ms |
784 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
2 ms |
788 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
2 ms |
792 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
2 ms |
796 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
2 ms |
800 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
2 ms |
804 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
2 ms |
808 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
2 ms |
812 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
2 ms |
816 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
1076 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
2 ms |
1204 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
4 ms |
1204 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
2 ms |
1204 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
3 ms |
1204 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
3 ms |
1204 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
3 ms |
1204 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
2 ms |
1204 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
3 ms |
1204 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
3 ms |
1204 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
4 ms |
3076 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
4 ms |
3076 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
11 ms |
3080 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
4 ms |
3088 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
12 ms |
3112 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
11 ms |
3116 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
12 ms |
3120 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
15 ms |
3144 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
6 ms |
3180 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
8 ms |
3180 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
23 ms |
24664 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
22 ms |
24664 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
149 ms |
24696 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
24 ms |
24756 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
116 ms |
24800 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
133 ms |
24820 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
123 ms |
24984 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
104 ms |
25032 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
117 ms |
25032 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
146 ms |
25032 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
118 ms |
132096 KB |
Execution killed with signal 9 (could be triggered by violating memory limits) |
| 2 |
Halted |
0 ms |
0 KB |
- |
