제출 #1289144

#제출 시각아이디문제언어결과실행 시간메모리
1289144YENGOYANBigger segments (IZhO19_segments)C++17
0 / 100
1 ms568 KiB
#include <bits/stdc++.h> using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int n; cin >> n; vector<long long> a(n); for (auto &x : a) cin >> x; long long prev_sum = 0, curr_sum = 0; int segments = 0; for (int i = 0; i < n; ++i) { curr_sum += a[i]; if (curr_sum >= prev_sum) { ++segments; prev_sum = curr_sum; curr_sum = 0; } } cout << segments << "\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...