#pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
#include<bits/stdc++.h>
//#include "boxes.h"
#define rc(x) return cout<<x<<endl,0
#define pb push_back
#define mkp make_pair
#define in insert
#define er erase
#define fd find
#define fr first
#define sc second
typedef long long ll;
typedef long double ld;
const ll INF=0x3f3f3f3f3f3f3f3f;
const ll llinf=(1LL<<61);
const int inf=(1<<30);
const int nmax=1e5+50;
const int mod=1e9+7;
using namespace std;
int n,k,i,j,t,id,pr[205][nmax];
ll f[205][nmax],a[nmax],p[nmax],mx,x;
int main()
{
//freopen("sol.in","r",stdin);
//freopen("sol.out","w",stdout);
//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
ios_base::sync_with_stdio(false);cin.tie(0);cerr.tie(0);cout.tie(0);
cin>>n>>k;
for(i=1;i<=n;i++)cin>>a[i];
for(i=1;i<=n;i++)p[i]=p[i-1]+a[i];
for(i=1;i<=k;i++)
{
for(j=0;j<=n;j++)
{
for(t=j+1;t<n;t++)
{
x=f[i-1][j]+(p[t]-p[j])*(p[n]-p[t]);
if(x>f[i][t])
{
f[i][t]=x;
pr[i][t]=j;
}
if(f[i][t]>mx)
{
mx=f[i][t];
id=t;
}
}
}
}
cout<<mx<<endl;
for(i=k;i>=1;i--)
{
cout<<id<<" ";
id=pr[i][id];
}
cout<<endl;
return 0;
}
Compilation message
sequence.cpp:2:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
#pragma GCC optimization("O3")
sequence.cpp:3:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
#pragma GCC optimization("unroll-loops")
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Incorrect |
2 ms |
376 KB |
Integer 0 violates the range [1, 1] |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
3 ms |
888 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
2 ms |
504 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
2 ms |
480 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
2 ms |
636 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
2 ms |
504 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
2 ms |
504 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
2 ms |
504 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
12 ms |
2940 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
2 ms |
376 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
9 ms |
2168 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Incorrect |
11 ms |
2552 KB |
Integer 0 violates the range [1, 199] |
| 7 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
5 ms |
376 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
5 ms |
376 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
189 ms |
4668 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
5 ms |
376 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
197 ms |
4792 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
166 ms |
4088 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
191 ms |
4852 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
192 ms |
4776 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
42 ms |
1192 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
78 ms |
2084 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
286 ms |
956 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
269 ms |
964 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Execution timed out |
2060 ms |
3444 KB |
Time limit exceeded |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
2071 ms |
3320 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
