제출 #341124

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
341124		Dilshod_Imomov	Bigger segments (IZhO19_segments)	C++17	0 / 100	1 ms	384 KiB

segments

# include <bits/stdc++.h>
# define speed ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
# define int long long
# define fi first
# define se second
 
using namespace std;
 
const int N = 5e3 + 7;
const int mod = 1e9 + 7;
int a[N]; 

int32_t main() {
    speed; 
    int n;
    cin >> n;
    for ( int i = 1; i <= n; i++ ) {
        cin >> a[i];
    }
    int sum = 0, mx = 0;
    for ( int len = 1; len <= n; len++ ) {
        sum += a[len];
        int cnt = 1, sm = sum, s = 0;
        for ( int i = len + 1; i <= n; i++ ) {
            s += a[i];
            if ( s >= sm ) {
                sm = s;
                s = 0;
                cnt++;
                continue;
            }
            if ( i == n ) {
                cnt = 0;
            }
        }
        mx = max( mx, cnt );
    }
    cout << mx;
}

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