# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
444762 | impri | Split the sequence (APIO14_sequence) | C++14 | 1235 ms | 89712 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;
int n,k;
int arr[100001];
long long psum[100001];
long long dp[100001][2];
int res[100001][202];
struct line{
long long a,b;
double s;
int p;
};
int main(void){
cin.tie(0);
ios_base::sync_with_stdio(false);
cin >> n >> k;
k++;
for(int i=1;i<=n;i++)
cin >> arr[i];
for(int i=1;i<=n;i++)
psum[i]=psum[i-1]+arr[i];
for(int i=1;i<n;i++)
dp[i][1]=psum[i]*(psum[n]-psum[i]);
for(int i=2;i<=k;i++){
vector<line>lines;
lines.push_back({-psum[i-1],dp[i-1][(i+1)%2],10e12,i-1});
int cur=0;
for(int j=i;j<=n;j++){
while(1){
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... |