#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(long long i=0;i<(long long)(n);i++)
#define REP(i,k,n) for(long long i=k;i<(long long)(n);i++)
#define all(a) a.begin(),a.end()
#define pb emplace_back
#define eb emplace_back
#define lb(v,k) (lower_bound(all(v),k)-v.begin())
#define ub(v,k) (upper_bound(all(v),k)-v.begin())
#define fi first
#define se second
#define pi M_PI
#define PQ(T) priority_queue<T>
#define SPQ(T) priority_queue<T,vector<T>,greater<T>>
#define dame(a) {out(a);return 0;}
#define decimal cout<<fixed<<setprecision(15);
#define dupli(a) {sort(all(a));a.erase(unique(all(a)),a.end());}
typedef long long ll;
typedef pair<ll,ll> P;
typedef tuple<ll,ll,ll> PP;
typedef tuple<ll,ll,ll,ll> PPP;
typedef multiset<ll> S;
using vi=vector<ll>;
using vvi=vector<vi>;
using vvvi=vector<vvi>;
using vvvvi=vector<vvvi>;
using vp=vector<P>;
using vvp=vector<vp>;
using vb=vector<bool>;
using vvb=vector<vb>;
const ll inf=1001001001001001001;
const ll INF=1001001001;
const ll mod=1000000007;
const double eps=1e-10;
template<class T> bool chmin(T&a,T b){if(a>b){a=b;return true;}return false;}
template<class T> bool chmax(T&a,T b){if(a<b){a=b;return true;}return false;}
template<class T> void out(T a){cout<<a<<'\n';}
template<class T> void outp(T a){cout<<'('<<a.fi<<','<<a.se<<')'<<'\n';}
template<class T> void outvp(T v){rep(i,v.size())cout<<'('<<v[i].fi<<','<<v[i].se<<')';cout<<'\n';}
template<class T> void outvvp(T v){rep(i,v.size())outvp(v[i]);}
template<class T> void outv(T v){rep(i,v.size()){if(i)cout<<' ';cout<<v[i];}cout<<'\n';}
template<class T> void outvv(T v){rep(i,v.size())outv(v[i]);}
template<class T> bool isin(T x,T l,T r){return (l)<=(x)&&(x)<=(r);}
template<class T> void yesno(T b){if(b)out("yes");else out("no");}
template<class T> void YesNo(T b){if(b)out("Yes");else out("No");}
template<class T> void YESNO(T b){if(b)out("YES");else out("NO");}
template<class T> void noyes(T b){if(b)out("no");else out("yes");}
template<class T> void NoYes(T b){if(b)out("No");else out("Yes");}
template<class T> void NOYES(T b){if(b)out("NO");else out("YES");}
void outs(ll a,ll b){if(a>=inf-100)out(b);else out(a);}
ll gcd(ll a,ll b){if(b==0)return a;return gcd(b,a%b);}
ll modpow(ll a,ll b){ll res=1;a%=mod;while(b){if(b&1)res=res*a%mod;a=a*a%mod;b>>=1;}return res;}
vector<PP> cht;
ll id=0;
void add(ll a,ll b,ll num){
// out(a);out(b);out(num);
while(cht.size()){
if(get<0>(cht.back())==a){
if(b<=get<2>(cht.back()))return;
cht.pop_back();
}
else break;
}
while(cht.size()>1){
auto p=cht[cht.size()-2],q=cht.back();
if((a-get<0>(q))*(b-get<1>(p))>(get<1>(q)-b)*(get<0>(p)-a))break;
cht.pop_back();
}
cht.eb(a,b,num);
}
P getma(ll x){
while(id+1<cht.size()){
if(get<0>(cht[id])*x+get<1>(cht[id])>get<0>(cht[id+1])*x+get<1>(cht[id+1]))break;
id++;
}
return P(get<0>(cht[id])*x+get<1>(cht[id]),get<2>(cht[id]));
}
int main(){
ll n,k;cin>>n>>k;
vi v(n);rep(i,n)cin>>v[i];
vi rui(n+1);
rep(i,n)rui[i+1]=rui[i]+v[i];
vi dp(n,-inf);
dp[0]=0;
vector<vector<int>> f(k+1,vector<int>(n));
REP(i,1,k+1){
vi ndp(n,-inf);
cht=vector<PP>(0);id=0;
REP(j,i,n){
if(dp[j-1]!=-inf)add(rui[j-1],dp[j-1]-rui[n]*rui[j-1],j-1);
// rep(t,j)if(chmax(dp[i][j],dp[i-1][t]+(rui[j]-rui[t])*(rui[n]-rui[j])))f[i][j]=t;
auto res=getma(rui[j]);
ndp[j]=res.fi-rui[j]*rui[j]+rui[n]*rui[j];f[i][j]=res.se;
}
dp=ndp;
}
ll ans=0;
rep(i,n)chmax(ans,dp[i]);
out(ans);
vi t;
rep(i,n)if(dp[i]==ans){
t.pb(i);break;
}
for(int i=k;i>1;i--)t.pb(f[i][t.back()]);
outv(t);
}
Compilation message
sequence.cpp: In function 'P getma(ll)':
sequence.cpp:73:15: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<std::tuple<long long int, long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
73 | while(id+1<cht.size()){
| ~~~~^~~~~~~~~~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
256 KB |
contestant found the optimal answer: 108 == 108 |
2 |
Correct |
0 ms |
256 KB |
contestant found the optimal answer: 999 == 999 |
3 |
Correct |
0 ms |
256 KB |
contestant found the optimal answer: 0 == 0 |
4 |
Correct |
0 ms |
256 KB |
contestant found the optimal answer: 1542524 == 1542524 |
5 |
Correct |
0 ms |
256 KB |
contestant found the optimal answer: 4500000000 == 4500000000 |
6 |
Correct |
0 ms |
256 KB |
contestant found the optimal answer: 1 == 1 |
7 |
Correct |
1 ms |
256 KB |
contestant found the optimal answer: 1 == 1 |
8 |
Correct |
0 ms |
256 KB |
contestant found the optimal answer: 1 == 1 |
9 |
Correct |
0 ms |
256 KB |
contestant found the optimal answer: 100400096 == 100400096 |
10 |
Correct |
0 ms |
256 KB |
contestant found the optimal answer: 900320000 == 900320000 |
11 |
Correct |
1 ms |
288 KB |
contestant found the optimal answer: 3698080248 == 3698080248 |
12 |
Correct |
1 ms |
256 KB |
contestant found the optimal answer: 3200320000 == 3200320000 |
13 |
Correct |
0 ms |
256 KB |
contestant found the optimal answer: 140072 == 140072 |
14 |
Correct |
0 ms |
256 KB |
contestant found the optimal answer: 376041456 == 376041456 |
15 |
Correct |
0 ms |
256 KB |
contestant found the optimal answer: 805 == 805 |
16 |
Correct |
0 ms |
256 KB |
contestant found the optimal answer: 900189994 == 900189994 |
17 |
Correct |
0 ms |
256 KB |
contestant found the optimal answer: 999919994 == 999919994 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
256 KB |
contestant found the optimal answer: 1093956 == 1093956 |
2 |
Correct |
0 ms |
256 KB |
contestant found the optimal answer: 302460000 == 302460000 |
3 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 122453454361 == 122453454361 |
4 |
Correct |
0 ms |
256 KB |
contestant found the optimal answer: 93663683509 == 93663683509 |
5 |
Correct |
0 ms |
256 KB |
contestant found the optimal answer: 1005304678 == 1005304678 |
6 |
Correct |
0 ms |
256 KB |
contestant found the optimal answer: 933702 == 933702 |
7 |
Correct |
1 ms |
256 KB |
contestant found the optimal answer: 25082842857 == 25082842857 |
8 |
Correct |
1 ms |
288 KB |
contestant found the optimal answer: 687136 == 687136 |
9 |
Correct |
0 ms |
256 KB |
contestant found the optimal answer: 27295930079 == 27295930079 |
10 |
Correct |
1 ms |
256 KB |
contestant found the optimal answer: 29000419931 == 29000419931 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 610590000 == 610590000 |
2 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 311760000 == 311760000 |
3 |
Correct |
2 ms |
512 KB |
contestant found the optimal answer: 1989216017013 == 1989216017013 |
4 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 1499437552673 == 1499437552673 |
5 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 1019625819 == 1019625819 |
6 |
Correct |
1 ms |
512 KB |
contestant found the optimal answer: 107630884 == 107630884 |
7 |
Correct |
1 ms |
512 KB |
contestant found the optimal answer: 475357671774 == 475357671774 |
8 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 193556962 == 193556962 |
9 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 482389919803 == 482389919803 |
10 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 490686959791 == 490686959791 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 21503404 == 21503404 |
2 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 140412195 == 140412195 |
3 |
Correct |
6 ms |
1152 KB |
contestant found the optimal answer: 49729674225461 == 49729674225461 |
4 |
Correct |
1 ms |
384 KB |
contestant found the optimal answer: 37485571387523 == 37485571387523 |
5 |
Correct |
7 ms |
1152 KB |
contestant found the optimal answer: 679388326 == 679388326 |
6 |
Correct |
6 ms |
1056 KB |
contestant found the optimal answer: 4699030287 == 4699030287 |
7 |
Correct |
8 ms |
1152 KB |
contestant found the optimal answer: 12418819758185 == 12418819758185 |
8 |
Correct |
7 ms |
1152 KB |
contestant found the optimal answer: 31093317350 == 31093317350 |
9 |
Correct |
2 ms |
512 KB |
contestant found the optimal answer: 12194625429236 == 12194625429236 |
10 |
Correct |
3 ms |
768 KB |
contestant found the optimal answer: 12345131038664 == 12345131038664 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
1232 KB |
contestant found the optimal answer: 1818678304 == 1818678304 |
2 |
Correct |
5 ms |
1152 KB |
contestant found the optimal answer: 1326260195 == 1326260195 |
3 |
Correct |
96 ms |
9572 KB |
contestant found the optimal answer: 4973126687469639 == 4973126687469639 |
4 |
Correct |
7 ms |
1448 KB |
contestant found the optimal answer: 3748491676694116 == 3748491676694116 |
5 |
Correct |
55 ms |
5820 KB |
contestant found the optimal answer: 1085432199 == 1085432199 |
6 |
Correct |
53 ms |
6556 KB |
contestant found the optimal answer: 514790755404 == 514790755404 |
7 |
Correct |
80 ms |
7600 KB |
contestant found the optimal answer: 1256105310476641 == 1256105310476641 |
8 |
Correct |
59 ms |
6452 KB |
contestant found the optimal answer: 3099592898816 == 3099592898816 |
9 |
Correct |
67 ms |
6824 KB |
contestant found the optimal answer: 1241131419367412 == 1241131419367412 |
10 |
Correct |
85 ms |
8832 KB |
contestant found the optimal answer: 1243084101967798 == 1243084101967798 |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
43 ms |
10132 KB |
contestant found the optimal answer: 19795776960 == 19795776960 |
2 |
Correct |
47 ms |
9960 KB |
contestant found the optimal answer: 19874432173 == 19874432173 |
3 |
Correct |
1062 ms |
88660 KB |
contestant found the optimal answer: 497313449256899208 == 497313449256899208 |
4 |
Correct |
63 ms |
10932 KB |
contestant found the optimal answer: 374850090734572421 == 374850090734572421 |
5 |
Correct |
1129 ms |
87828 KB |
contestant found the optimal answer: 36183271951 == 36183271951 |
6 |
Correct |
452 ms |
62304 KB |
contestant found the optimal answer: 51629847150471 == 51629847150471 |
7 |
Correct |
890 ms |
68908 KB |
contestant found the optimal answer: 124074747024496432 == 124074747024496432 |
8 |
Correct |
697 ms |
57604 KB |
contestant found the optimal answer: 309959349080800 == 309959349080800 |
9 |
Correct |
784 ms |
64604 KB |
contestant found the optimal answer: 124113525649823701 == 124113525649823701 |
10 |
Correct |
983 ms |
80384 KB |
contestant found the optimal answer: 124309619349406845 == 124309619349406845 |