# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
975511 | Nexus | Split the sequence (APIO14_sequence) | C++17 | 102 ms | 3736 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
using namespace std;
const ll N=1e3+9,M=2e18+9,mod=1e9+7;
ll a[N],s[N],dp[N][209],p[N][209],n,k,x,y,z,o=-M;
vector<ll>v;
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);cout.tie(0);
cin>>n>>k;
for(ll i=1;i<=n;++i)cin>>a[i];
for(ll i=n;i;--i)s[i]=a[i]+s[i+1];
for(ll i=1;i<n;++i)
{
dp[i][1]=(s[1]-s[i+1])*s[i+1],p[i][1]=i;
if(dp[i][1]>o)o=dp[i][1],z=i;
}
for(ll j=2;j<=k;++j)
{
for(ll i=j;i<=n;++i)
{
# | 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... |