# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
848732 | lbadea1000 | Split the sequence (APIO14_sequence) | C++17 | 1 ms | 556 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;
const int NMAX = 1e5;
int v[NMAX], sp[NMAX];
vector<int> split_points;
int sum(int l, int r) {
if(l == 0) return sp[r];
return sp[r] - sp[l - 1];
}
int main() {
int n, k;
FILE *fin, *fout;
fin = fopen("sequence.in", "r");
fout = fopen("sequence.out", "w");
fscanf(fin, "%d%d", &n, &k);
for(int i = 0; i < n; i++)
fscanf(fin, "%d", &v[i]);
sp[0] = v[0];
for(int i = 1; i < n; i++)
sp[i] = sp[i - 1] + v[i];
long long ans = 0;
int kk = k;
while(kk--) {
int first = -1, end;
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... |