# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
399009 | wnguscjf01 | Split the sequence (APIO14_sequence) | C++14 | 1595 ms | 87628 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>
#define MAXK 201
#define MAXN 100001
using namespace std;
struct data{
long long int slope, yy;
double s;
int num;
};
struct data d[2][MAXN];
bool compare(const struct data &a, const struct data &b){
return a.s < b.s;
}
double cross(struct data &a, struct data &b){
if(a.slope == b.slope) return -1.0*LLONG_MIN;
return 1.0*(b.yy-a.yy)/(a.slope-b.slope);
}
long long int ans[2][MAXN], sum[MAXN];
int dsize[2], tr[MAXK][MAXN], ans2[MAXN];
int main()
{
int n, k, i, j;
cin >> n >> k;
for(i=1; i<=n; i++){
int aa;
scanf("%d",&aa);
sum[i] = sum[i-1]+aa;
}
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... |