Submission #216984

#	Time	Username	Problem	Language	Result	Execution time	Memory
216984		lukameladze	Bigger segments (IZhO19_segments)	C++14	37 / 100	1596 ms	3264 KiB

segments

# include <bits/stdc++.h>
using namespace std;
long long n,a[100005],sum[100005];
pair <long long , long long> dp[100005];
int main()
{
     cin>>n;
     for (int i=1; i<=n; i++)
     {
          cin>>a[i];
          sum[i]=sum[i-1]+a[i];
     }
     for (int i=1; i<=n; i++)
     {
          for (int j=i-1; j>=0; j--)
          {
               if (dp[i].first<=dp[j].first && sum[i]-sum[j]>=dp[j].second)
               {
                    dp[i].first=dp[j].first+1;
                    dp[i].second=sum[i]-sum[j];
               }
          }
     }
     cout<<dp[n].first<<endl;
}

• Subtask 1: 13 / 13
• Subtask 2: 14 / 14
• Subtask 3: 10 / 10
• Subtask 4: 0 / 36
• Subtask 5: 0 / 27