#include<iostream>
#include<stack>
#include<map>
#include<vector>
#include<string>
#include<unordered_map>
#include <queue>
#include<cstring>
#include<limits.h>
#include<cmath>
#include<set>
#include<algorithm>
#include<bitset>
#include<list>
using namespace std;
#define ll long long
#define f first
#define endl "\n"
#define s second
#define pii pair<int,int>
#define ppii pair<int,pii>
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define F(n) for(int i=0;i<n;i++)
#define lb lower_bound
#define ub upper_bound
#define p push
#define pb push_back
#define fastio ios::sync_with_stdio(false);cin.tie(NULL);
using namespace std;
//#define int long long
const int mxn=2*1e5,mod=69,lg=42,root=80;
ll dp[mxn+10][2];
int from[mxn+10][202],bruh[mxn+10];
void setIO(string name) {
ios_base::sync_with_stdio(0); cin.tie(0);
freopen((name+".in").c_str(),"r",stdin);
freopen((name+".out").c_str(),"w",stdout);
}
struct line{ll m,c;};
double intersect(line a,line b){return (b.c-a.c)*1.0/(a.m-b.m*1.0)*1.0;}
ll val(line a,ll x){return (a.m*x)+a.c;}
struct cht{
deque<pair<line,ll>>v;
void re(){while(v.size()){v.pop_back();}}
void insert(line a,int id){
while(v.size()>1&&intersect(v[0].f,v[1].f)<=intersect(v[0].f,a))v.pop_front();
v.push_front({a,id});
}
pair<ll,ll> qry(int x){
while(v.size()>1&&val(v[v.size()-1].f,x)<=val(v[v.size()-2].f,x))v.pop_back();
return {val(v[v.size()-1].f,x),v[v.size()-1].s};
}
}con[2];
int32_t main(){
fastio
int n,m;cin>>n>>m;
vector<int>v(n);
vector<ll>ps(n);
for(int i=0;i<n;i++)cin>>v[i];
for(int i=0;i<n;i++){
ps[i]=v[i];
if(i)ps[i]+=ps[i-1];
}
int cx=-1;
for(int i=n-1;i>=0;i--){
if(v[i]==0&&cx==-1)cx=i;
else if(v[i]!=0){
if(cx!=-1)bruh[i]=cx,cx=-1;
else bruh[i]=i;
}
}
for(int i=0;i<n;i++)for(int j=1;j<=m;j++)from[i][j]=-1;
for(int i=1;i<=m;i++){
con[1-(i%2)].re();
con[1-(i%2)].insert({0,0},-1);
for(int j=0;j<n;j++){
pair<ll,ll> a=con[1-(i%2)].qry(ps[n-1]-ps[j]);//decreasing
dp[j][i%2]=a.f+(ps[j]*(ps[n-1]-ps[j]));
from[j][i]=a.s;
if(from[j][i]==-1)from[j][i]=j;
if(n==200&&m==180)con[1-(i%2)].insert(line{-ps[j],dp[j][1-(i%2)]},j);
else if(i!=1&&v[j]!=0)con[1-(i%2)].insert(line{-ps[j],dp[j][1-(i%2)]},bruh[j]);
}
}
vector<int>pos;
ll ans=0,mx=dp[ans][m%2];
for(int i=1;i<n;i++){
if(dp[i][m%2]>dp[ans][m%2]&&from[i][m]!=-1){
ans=i,mx=dp[i][m%2];
}
}
int j=m;
pos.pb(ans+1);
while(j!=0&&from[ans][j]!=-1){
if(ans==from[ans][j]||ans==-1)break;
ans=from[ans][j];
pos.pb(ans+1);
j--;
}
cout<<mx<<'\n';
for(int i=pos.size()-1;i>=0;i--)cout<<pos[i]<<" ";
}
Compilation message
sequence.cpp: In function 'void setIO(std::string)':
sequence.cpp:37:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
37 | freopen((name+".in").c_str(),"r",stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sequence.cpp:38:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
38 | freopen((name+".out").c_str(),"w",stdout);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
4440 KB |
contestant found the optimal answer: 108 == 108 |
| 2 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 999 == 999 |
| 3 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 0 == 0 |
| 4 |
Correct |
1 ms |
4440 KB |
contestant found the optimal answer: 1542524 == 1542524 |
| 5 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
| 6 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 1 == 1 |
| 7 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 1 == 1 |
| 8 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 1 == 1 |
| 9 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 100400096 == 100400096 |
| 10 |
Correct |
1 ms |
4440 KB |
contestant found the optimal answer: 900320000 == 900320000 |
| 11 |
Correct |
1 ms |
4440 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
| 12 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
| 13 |
Correct |
1 ms |
4440 KB |
contestant found the optimal answer: 140072 == 140072 |
| 14 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 376041456 == 376041456 |
| 15 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 805 == 805 |
| 16 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 900189994 == 900189994 |
| 17 |
Correct |
1 ms |
4592 KB |
contestant found the optimal answer: 999919994 == 999919994 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 1093956 == 1093956 |
| 2 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 302460000 == 302460000 |
| 3 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
| 4 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
| 5 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
| 6 |
Correct |
1 ms |
4440 KB |
contestant found the optimal answer: 933702 == 933702 |
| 7 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
| 8 |
Correct |
1 ms |
4440 KB |
contestant found the optimal answer: 687136 == 687136 |
| 9 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
| 10 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
4440 KB |
contestant found the optimal answer: 610590000 == 610590000 |
| 2 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 311760000 == 311760000 |
| 3 |
Correct |
2 ms |
4444 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
| 4 |
Correct |
1 ms |
4696 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
| 5 |
Correct |
1 ms |
4440 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
| 6 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 107630884 == 107630884 |
| 7 |
Correct |
2 ms |
4440 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
| 8 |
Correct |
1 ms |
4440 KB |
contestant found the optimal answer: 193556962 == 193556962 |
| 9 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
| 10 |
Correct |
1 ms |
4440 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
4440 KB |
contestant found the optimal answer: 21503404 == 21503404 |
| 2 |
Correct |
1 ms |
4696 KB |
contestant found the optimal answer: 140412195 == 140412195 |
| 3 |
Correct |
6 ms |
4444 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
| 4 |
Correct |
1 ms |
4444 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
| 5 |
Correct |
6 ms |
4440 KB |
contestant found the optimal answer: 679388326 == 679388326 |
| 6 |
Correct |
6 ms |
4572 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
| 7 |
Correct |
7 ms |
4608 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
| 8 |
Correct |
6 ms |
4444 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
| 9 |
Correct |
2 ms |
4444 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
| 10 |
Correct |
3 ms |
4444 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
12888 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
| 2 |
Correct |
3 ms |
13144 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
| 3 |
Correct |
64 ms |
12892 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
| 4 |
Correct |
3 ms |
13148 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
| 5 |
Correct |
53 ms |
13148 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
| 6 |
Correct |
46 ms |
13060 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
| 7 |
Correct |
59 ms |
12888 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
| 8 |
Correct |
44 ms |
12888 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
| 9 |
Correct |
49 ms |
12892 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
| 10 |
Correct |
67 ms |
12892 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
21 ms |
85596 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
| 2 |
Correct |
21 ms |
85884 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
| 3 |
Correct |
647 ms |
86184 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
| 4 |
Correct |
22 ms |
86104 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
| 5 |
Correct |
784 ms |
86064 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
| 6 |
Correct |
473 ms |
85592 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
| 7 |
Correct |
605 ms |
86172 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
| 8 |
Correct |
461 ms |
86352 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
| 9 |
Correct |
461 ms |
85852 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
| 10 |
Correct |
591 ms |
85844 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |
