# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
108133 | maruii | Split the sequence (APIO14_sequence) | C++14 | 594 ms | 85880 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 <bits/stdc++.h>
using namespace std;
using ll = long long;
#define ff first
#define ss second
int A[100001], S[100001];
ll dp[2][100001];
pair<int, ll> line[2][100001];
int cnt[2], idx[2][100001];
int pre[201][100001];
inline ll f(int t, int i, int x){
return 1ll * line[t][i].ff * x + line[t][i].ss;
}
inline double crs(pair<int, ll> x, pair<int, ll> y){
return (double)(y.ss - x.ss) / (x.ff - y.ff);
}
int main(){
ios_base::sync_with_stdio(0), cin.tie(0);
int N, K; cin>>N>>K;
for(int i=0; i<N; ++i) cin>>A[i];
S[0] = A[0];
for(int i=1; i<N; ++i) S[i] = S[i-1] + A[i];
idx[1][1] = N;
for(int k=0; k<=K; ++k){
int t = k&1;
cnt[t] = 0;
# | 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... |