#include<bits/stdc++.h>
#define ll long long
#define lll __int128
#define pi 3.1415926535897932384626
using namespace std;
struct P{
int x,y,z;
bool operator <(const P &a)const
{
//if(x!=a.x)
return x<a.x;
// return z<a.z;
};
};
int dx[10]={1,0,-1,0,1,1,-1,-1},dy[10]={0,1,0,-1,1,-1,1,-1};
const ll mod=1000000007,Max=mod,Min=-Max;
int a,b;
int o[111111],c[222][111111];
ll dp[111111],ss[111111],aa[111111];
void f(int p,int n,int m,int x,int y)
{
if(n>m) return;
int h=(n+m)/2;
aa[h]=dp[h+1]+(ss[a]-ss[h])*o[h];
c[p][h]=h;
for(int i=max(x,h);i<=y;i++)
if(aa[h]<(ss[a]-ss[i])*(ss[i]-ss[h-1])+dp[i+1])
{
aa[h]=(ss[a]-ss[i])*(ss[i]-ss[h-1])+dp[i+1];
c[p][h]=i;
}
f(p,n,h-1,x,c[p][h]);
f(p,h+1,m,c[p][h],y);
}
int main()
{
scanf("%d %d",&a,&b);
for(int t=1;t<=a;t++)
{
scanf("%d",&o[t]);
ss[t]=ss[t-1]+o[t];
}
for(int t=1;t<=a;t++) c[0][t]=a;
for(int i=1;i<=b;i++)
{
aa[111111];
memset(aa,-1,sizeof(aa));
f(i,1,a,1,a);
for(int t=1;t<=a;t++)
dp[t]=aa[t];
}
printf("%lld\n",dp[1]);
int e=1;
for(int t=b;t;t--)
{
//printf("%d %d\n",c[t][e],e);
printf("%d ",c[t][e]);
e=c[t][e]+1;
}
}
Compilation message
sequence.cpp: In function 'int main()':
sequence.cpp:51:14: warning: statement has no effect [-Wunused-value]
51 | aa[111111];
| ~~~~~~~~~^
sequence.cpp:42:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
42 | scanf("%d %d",&a,&b);
| ~~~~~^~~~~~~~~~~~~~~
sequence.cpp:45:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
45 | scanf("%d",&o[t]);
| ~~~~~^~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
1204 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
1 ms |
1200 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
1 ms |
1108 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
1 ms |
1108 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
1 ms |
1236 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
1 ms |
1108 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
1 ms |
1108 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
1 ms |
1108 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
1 ms |
1108 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
1 ms |
1108 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
1 ms |
1108 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
1 ms |
1108 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
1 ms |
1108 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
1 ms |
1208 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
1 ms |
1108 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
1 ms |
1204 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
1 ms |
1200 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
1108 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
1 ms |
1204 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
2 ms |
1364 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
1 ms |
1108 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
1 ms |
1200 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
1 ms |
1152 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
2 ms |
1236 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
1 ms |
1236 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
1 ms |
1204 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
1 ms |
1236 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
1108 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
1 ms |
1108 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
6 ms |
2260 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
1 ms |
1108 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
5 ms |
1928 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
6 ms |
2132 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
7 ms |
2228 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
3 ms |
1364 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
2 ms |
1236 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
5 ms |
1460 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
1236 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
1 ms |
1236 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
11 ms |
2900 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
1 ms |
1236 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
14 ms |
2916 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
12 ms |
2716 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
13 ms |
2876 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
10 ms |
2900 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
4 ms |
1492 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
6 ms |
1876 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
4 ms |
1492 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
3 ms |
1492 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
68 ms |
10092 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
3 ms |
1492 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
86 ms |
6596 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
67 ms |
7520 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
66 ms |
8024 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
46 ms |
6668 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
62 ms |
7520 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
98 ms |
9252 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
39 ms |
4868 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
30 ms |
4812 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
739 ms |
83100 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
21 ms |
5188 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
1248 ms |
82764 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
832 ms |
59012 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
698 ms |
63220 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
505 ms |
52100 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
696 ms |
59288 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
848 ms |
74984 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
