Submission #1114376

#	Time	Username	Problem	Language	Result	Execution time	Memory
1114376		vjudge1	Bigger segments (IZhO19_segments)	C++17	0 / 100	1572 ms	336 KiB

segments

#include <bits/stdc++.h>
using namespace std;
#define int long long

signed main()
{
    int n; cin >> n;
    vector<int> a(n + 1), pref(n + 1);
    for (int i = 1;  i<= n; i++){
        cin >> a[i];
        pref[i] = pref[i - 1] + a[i];
    }
    vector<vector<int>> dp(n + 1, vector<int> (n + 1, 0));
    
    dp[0][0] = 0;
    for (int i = 1; i <= n; i++){
        dp[i][1] = pref[i];
    }
    for (int j = 2; j <= n; j++){
        for (int i = j; i <= n; i++){
           
           
           int ini = 1, fin = i;
           
           while(ini < fin){
               
               int m = (ini + fin) / 2;
               
               if (pref[i] < dp[m][j - 1] + pref[m]){
                   fin = m - 1;
               }else{
                   ini = m;
               }
           }
           ini--;
           
           int suma = pref[i] - pref[ini];
           if (suma >= dp[ini][j - 1] && dp[ini][j - 1]) dp[i][j] = suma;
        }
    }
    
    /*for (int i = 0; i <= n; i++){
        for (int j = 0; j <= n; j++){
            cout << dp[i][j] << ' ';
        }
        cout << endl;
    }*/

    int ans = 1;
    for (int i = 1; i <= n; i++){
        
        if (dp[n][i]) ans = max(ans, i);
    }
    cout << ans << endl;
}

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