Submission #1177489

#	Time	Username	Problem	Language	Result	Execution time	Memory
1177489		Fikrat_Asadzadeh	Bigger segments (IZhO19_segments)	C++20	0 / 100	0 ms	324 KiB

segments

#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
 
int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    
    int n; 
    cin >> n;
    vector<ll> a(n);
    for (int i = 0; i < n; i++){
        cin >> a[i];
    }
    
    int count = 0;
    ll threshold = 0;
    int pos = 0;
    
    while(pos < n){
        ll seg_sum = 0;
        if(count == 0){
            // For the first segment, simply take one element.
            seg_sum = a[pos++];
            threshold = seg_sum;
            count++;
        } else {
            // For subsequent segments, we need seg_sum >= threshold.
            while(pos < n && seg_sum < threshold){
                seg_sum += a[pos++];
            }
            if(seg_sum < threshold) break;  // Not enough sum to meet threshold.
            threshold = seg_sum;
            count++;
        }
    }
    
    cout << count;
    return 0;
}

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