# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
908219 | sofija6 | Split the sequence (APIO14_sequence) | C++14 | 100 ms | 17772 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 ll long long
#define MAXN 10010
#define MAXK 210
using namespace std;
ll a[MAXN],dp[MAXN][2],prevv[MAXN][MAXK],pref[MAXN];
struct line
{
long double k,m;
long double Calc(ll x)
{
return k*x+m;
}
long double Intersect(line l)
{
return (m-l.m)/(l.k-k);
}
};
int main()
{
ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
ll n,k;
cin >> n >> k;
for (ll i=1;i<=n;i++)
{
cin >> a[i];
pref[i]=pref[i-1]+a[i];
}
deque<pair<line,ll> > d;
for (ll i=n-1;i>0;i--)
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... |