제출 #1323460

#제출 시각아이디문제언어결과실행 시간메모리
1323460husseinjuandaBigger segments (IZhO19_segments)C++20
0 / 100
0 ms332 KiB
#include <bits/stdc++.h>
using namespace std;
#define int long long

signed main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int n; cin >> n;
    vector<int> x(n);
    for(int i = 0; i < n; i++){
        cin >> x[i];
    }
    int cur = x[0];
    int cur1 = 0;
    vector<int> j;
    int co = 1;
    for(int i = 1; i < n; i++){
        cur1 += x[i];
        j.push_back(x[i]);
        if(cur1 >= cur){
            co++;
            for(int y = 0; y < j.size(); y++){
                if(cur1 - j[y] >= cur+j[y]){
                    cur1 -= j[y];
                    cur += j[y];
                }
            }
            j.clear();
            cur = cur1;
            cur1 = 0;
        }
    }
    cout << co << "\n";
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...