# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
112815 | Kamisama | Split the sequence (APIO14_sequence) | C++14 | 2062 ms | 85440 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <iostream>
#include <cstdio>
#include <iomanip>
#include <chrono>
//#define Kami
#define taskname "APIO14_sequence"
using namespace std;
const int maxn=1e5+3;
const int maxk=2e2+3;
struct TLines{
long long a, b; int id;
inline TLines(long long _a=0, long long _b=0, int _id=0){a=_a;b=_b;id=_id;}
inline long long Value(const long long &x){return a*x+b;}
friend inline bool isBad(const TLines &d1, const TLines &d2, const TLines &d3){
return (d2.b-d1.b)*(d1.a-d3.a)>=(d3.b-d1.b)*(d1.a-d2.a);
}
};
int n,k,a[maxn],trace[maxn][maxk];
long long s[maxn],f[maxn],g[maxn];
TLines convex[maxn];
inline void Enter(){
cin>>n>>k;
for(int i=1;i<=n;i++) cin>>a[i], s[i]=s[i-1]+a[i];
}
inline void Solve(){ // f[i] = max{ s[j]*s[i] + f[j] - s[j]^2 }
for(int t=1;t<=k;t++){
int best=1;
int nConvex=0;
swap(f,g);
for(int i=1;i<=n;i++){
long long x=s[i];
while(best<nConvex && convex[best].Value(x)<=convex[best+1].Value(x)) best++;
f[i]=convex[best].Value(x);
trace[i][t]=convex[best].id;
TLines newline(s[i],g[i]-s[i]*s[i],i);
while(nConvex>1 && isBad(convex[nConvex-1],convex[nConvex],newline)){
best-=(best==nConvex);
nConvex--;
} convex[++nConvex]=newline;
}
}
cout<<f[n]<<'\n';
int nG=0;
for(int x=n,i=k;i>=1;i--) cout<<(x=trace[x][i])<<' ';
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL); if(fopen(taskname".INP","r"))
freopen(taskname".INP","r",stdin),
freopen(taskname".OUT","w",stdout);
#ifdef Kami
auto start=chrono::steady_clock::now();
#endif
Enter();
Solve();
#ifdef Kami
auto end=chrono::steady_clock::now();
cerr<<"\nIn milliseconds : "
<<chrono::duration_cast<chrono::milliseconds>(end-start).count();
cerr<<'\n'<<"In seconds : "<<fixed<<setprecision(3)
<<(double)chrono::duration_cast<chrono::milliseconds>(end-start).count()/1000<<'\n';
#endif
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |