oj.uz

Submission #341156

# Submission time Handle Problem Language Result Execution time Memory
341156 2020-12-29T04:39:45 Z Dilshod_Imomov Bigger segments (IZhO19_segments) C++17
0 / 100
 1 ms 364 KB 
# 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 = 5e5 + 7;
const int mod = 1e9 + 7;

int a[N], sum[N], dp[N], ind[N];

int32_t main() {
    speed; 
    int n;
    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++ ) {
        ind[i] = max( ind[i - 1], ind[i] );
        dp[i] = dp[ ind[i] ] + 1;
        int l = i + 1, r = n + 1, ans = n + 1;
        while ( l <= r ) {
            int m = (l + r) / 2;
            if ( sum[m] - sum[i] >= sum[i] - sum[ ind[i] - 1 ] ) {
                ans = m;
                r = m - 1;
            }
            else {
                l = m + 1;
            }
        }
        ind[ans] = i;
    }
    cout << dp[n];
}

Subtask #1
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Incorrect 0 ms 364 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Incorrect 0 ms 364 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Incorrect 0 ms 364 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Incorrect 0 ms 364 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Incorrect 0 ms 364 KB Output isn't correct
3 Halted 0 ms 0 KB -