제출 #501448

#제출 시각아이디문제언어결과실행 시간메모리
501448LucaIlieBigger segments (IZhO19_segments)C++17
0 / 100
1 ms204 KiB
#include <iostream> using namespace std; int main() { int n, a, nrSegm, i; long long sumAnt, sumCrt; nrSegm = 0; sumAnt = sumCrt = 0; cin >> n; for ( i = 0; i < n; i++ ) { cin >> a; if ( sumCrt >= sumAnt ) { sumAnt = sumCrt; sumCrt = 0; nrSegm++; } sumCrt += a; } cout << nrSegm; 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...