# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
107063 | figter001 | Split the sequence (APIO14_sequence) | C++17 | 95 ms | 1192 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;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
const int nax = 2e5;
int pre[nax];
int main(){
int n,k;
cin>>n>>k;
vector<int> a(n),c;
for(int i=0;i<n;i++)
cin>>a[i];
for(int i=0;i<n;i++){
pre[i] = a[i];
if(i)pre[i] += pre[i-1];
}
ll ans = 0;
vector<int> cur;
cur.push_back(n);
for(int i=0;i<k;i++){
ll mx = 0;
int id = 0,at = 0,q = 0,b = 0;
int lf = 0,ri = 0;
for(int j=0;j<n-1;j++){
if(q == cur[id] - 1){
# | 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... |