# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
112809 | Kamisama | Split the sequence (APIO14_sequence) | C++14 | 6 ms | 4864 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=1e4+3;
const int maxk=1e2+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++){
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... |