# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
110876 | aleksam | Split the sequence (APIO14_sequence) | C++14 | 298 ms | 132096 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.
//Apio 14 sequence
#include <bits/stdc++.h>
#define INF INT_MAX
#define MOD 100000007
#define MAX_N 100005
#define MAX_K 205
using namespace std;
int N, K, a[MAX_N];
long long dp[MAX_K][MAX_N];
int sc[MAX_K][MAX_N];
int main(){
ios::sync_with_stdio(false);
cin>>N>>K;
for(int i=0; i<N; ++i){
cin>>a[i];
}
long long s=0;
for(int i=N-1; i>=0; --i){
s+=a[i];
dp[0][i]=s*s;
sc[0][i]=N;
}
for(int k=1; k<=K; ++k){
s=a[N-k-1];
dp[k][N-k-1]=dp[k-1][N-k]+s*s;
sc[k][N-k-1]=N-k;
int scc=N-k;
for(int i=N-k-2; i>=0; --i){
# | 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... |