Task: | Maximum sum |
Sender: | bielaltes |
Submission time: | 2024-09-16 16:35:11 +0300 |
Language: | C++ (C++11) |
Status: | READY |
Result: | ACCEPTED |
test | verdict | time | |
---|---|---|---|
#1 | ACCEPTED | 0.01 s | details |
#2 | ACCEPTED | 0.00 s | details |
#3 | ACCEPTED | 0.00 s | details |
#4 | ACCEPTED | 0.00 s | details |
#5 | ACCEPTED | 0.00 s | details |
#6 | ACCEPTED | 0.04 s | details |
#7 | ACCEPTED | 0.05 s | details |
#8 | ACCEPTED | 0.10 s | details |
#9 | ACCEPTED | 0.10 s | details |
#10 | ACCEPTED | 0.10 s | details |
#11 | ACCEPTED | 0.00 s | details |
#12 | ACCEPTED | 0.00 s | details |
#13 | ACCEPTED | 0.00 s | details |
#14 | ACCEPTED | 0.00 s | details |
#15 | ACCEPTED | 0.00 s | details |
Compiler report
input/code.cpp:21:23: warning: integer constant is so large that it is unsigned 21 | long long best = -9223372036854775808, current = 0; | ^~~~~~~~~~~~~~~~~~~
Code
#include <iostream> #include <vector> using namespace std; const int MOD = 1e9 + 7; int main() { int n; cin >> n; vector<long long> numbers = vector<long long>(n); for (int i = 0; i < n;++i) { int aux; cin >> aux; numbers[i] = aux; } long long best = -9223372036854775808, current = 0; for (int i = 0; i < n; ++i){ current = max(numbers[i], numbers[i] + current); best = max(best, current); } cout << best << endl; }
Test details
Test 1
Verdict: ACCEPTED
input |
---|
10 1 1 1 1 1 1 1 1 1 1 |
correct output |
---|
10 |
user output |
---|
10 |
Test 2
Verdict: ACCEPTED
input |
---|
10 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 |
correct output |
---|
-1 |
user output |
---|
-1 |
Test 3
Verdict: ACCEPTED
input |
---|
10 24 7 -27 17 -67 65 -23 58 85 -... |
correct output |
---|
185 |
user output |
---|
185 |
Test 4
Verdict: ACCEPTED
input |
---|
10 99 -59 31 83 -79 64 -20 -87 40... |
correct output |
---|
154 |
user output |
---|
154 |
Test 5
Verdict: ACCEPTED
input |
---|
10 -19 61 60 33 67 19 -8 92 59 -3... |
correct output |
---|
383 |
user output |
---|
383 |
Test 6
Verdict: ACCEPTED
input |
---|
200000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
correct output |
---|
200000 |
user output |
---|
200000 |
Test 7
Verdict: ACCEPTED
input |
---|
200000 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 ... |
correct output |
---|
-1 |
user output |
---|
-1 |
Test 8
Verdict: ACCEPTED
input |
---|
200000 381082742 830199996 -85684827 ... |
correct output |
---|
231210956017 |
user output |
---|
231210956017 |
Test 9
Verdict: ACCEPTED
input |
---|
200000 -935928962 -795492223 75287481... |
correct output |
---|
184607318819 |
user output |
---|
184607318819 |
Test 10
Verdict: ACCEPTED
input |
---|
200000 524408131 613017181 -62281009 ... |
correct output |
---|
360019999220 |
user output |
---|
360019999220 |
Test 11
Verdict: ACCEPTED
input |
---|
1 1 |
correct output |
---|
1 |
user output |
---|
1 |
Test 12
Verdict: ACCEPTED
input |
---|
1 -2 |
correct output |
---|
-2 |
user output |
---|
-2 |
Test 13
Verdict: ACCEPTED
input |
---|
5 -1 -1 -1 -1 -2 |
correct output |
---|
-1 |
user output |
---|
-1 |
Test 14
Verdict: ACCEPTED
input |
---|
2 -3 -2 |
correct output |
---|
-2 |
user output |
---|
-2 |
Test 15
Verdict: ACCEPTED
input |
---|
1 -1000000000 |
correct output |
---|
-1000000000 |
user output |
---|
-1000000000 |