Submission #1114355

#	Time	Username	Problem	Language	Result	Execution time	Memory
1114355		vjudge1	Bigger segments (IZhO19_segments)	C++17	0 / 100	1 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, -1));
    for (int i = 0; i <= n; i++) dp[i][0] = 0;
    for (int i = 1; i <= n; i++){
        for (int j = 0; j < i; j++){
           int ini = 0, fin = i;
           while(ini < fin){
               
               int m = (ini + fin) / 2;
               if (i == 2 && j == 0){
                   cout << m << ' ' << pref[i] << ' ' << dp[m][j] << ' ' << pref[m] << endl;
               }
               if (dp[m][j] >= 0 && pref[i] >= dp[m][j] + pref[m]){
                   fin = m;
               }else ini = m + 1;
           }
           
           int suma = pref[i] - pref[ini];
           //cout << i << ' ' << j << ' ' << suma << ' ' << ini << endl;
           if (suma >= dp[ini][j] && dp[ini][j] >= 0){
               dp[i][j + 1] = suma;
           }
        }
    }
    
    
    int ans = 0;
    for (int i = 1; i <= n; i++){
        
        if (dp[n][i] != -1) 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