# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1095409 | 2024-10-02T04:44:40 Z | KasymK | Bigger segments (IZhO19_segments) | C++17 | 0 ms | 0 KB |
#include "bits/stdc++.h" using namespace std; #define ff first #define ss second #define all(v) v.begin(), v.end() #define ll long long #define pb push_back #define pii pair<int, int> #define pli pair<ll, int> #define pll pair<ll, ll> #define tr(i, c) for(auto i = c.begin(); i != c.end(); ++i) #define wr puts("----------------") template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;} template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;} const int N = 3e3+5; pli dp[N]; ll par[N]; int main(){ int n; scanf("%d", &n); for(int i = 0; i <= n; ++i) dp[i] = {0, 0}; for(int i = 1; i <= n; ++i){ int x; scanf("%d", &x); par[i] = par[i-1]+x; } dp[1] = {par[1], 1}; for(int i = 1; i <= n; ++i) for(int j = i; j >= 1; --j) if(par[i]-par[j-1] >= dp[j-1].ff) if(umax(dp[i].ss, dp[j-1].ss+1)) dp[i].ff = par[i]-par[j-1]; printf("%d\n", dp[n].ss)s; return 0; }