oj.uz

Submission #155560

# Submission time Handle Problem Language Result Execution time Memory
155560 2019-09-29T05:02:06 Z semiauto Bigger segments (IZhO19_segments) C++14
0 / 100
 2 ms 380 KB 
#include <bits/stdc++.h>
using namespace std;
int n,i,j;
long long mas[3001],sum[3001];
pair <int,long long> dp[3001];
int main() {
    cin>>n;
    for (i=1;i<=n;i++) {
        cin>>mas[i];
        sum[i]=sum[i-1]+mas[i];
    }
    for (i=1;i<=n;i++)
        for (j=0;j<i;j++)
            //if ((-dp[j].second)<=(sum[i]-sum[j]))
                dp[i]=max(dp[i],{dp[j].first+1,sum[j]-sum[i]});
    cout<<dp[n].first<<endl;
}

Subtask #1
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 380 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 380 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 380 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 36.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 380 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 27.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 380 KB Output isn't correct
2 Halted 0 ms 0 KB -