CSES - Aalto Competitive Programming 2024 - wk3 - Mon - Results
Submission details
Task:Maximum sum
Sender:aalto2024b_005
Submission time:2024-09-16 16:28:46 +0300
Language:C++ (C++11)
Status:READY
Result:
Test results
testverdicttime
#1ACCEPTED0.00 sdetails
#20.00 sdetails
#3ACCEPTED0.00 sdetails
#4ACCEPTED0.00 sdetails
#5ACCEPTED0.00 sdetails
#6ACCEPTED0.02 sdetails
#70.02 sdetails
#8ACCEPTED0.04 sdetails
#9ACCEPTED0.04 sdetails
#10ACCEPTED0.04 sdetails
#11ACCEPTED0.00 sdetails
#120.00 sdetails
#130.00 sdetails
#140.00 sdetails
#150.00 sdetails

Compiler report

input/code.cpp: In function 'void Test()':
input/code.cpp:14:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   14 |     freopen("temp\\in.txt", "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
input/code.cpp: In function 'int main()':
input/code.cpp:20:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   20 |     scanf("%d", &n);
      |     ~~~~~^~~~~~~~~~
input/code.cpp:23:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   23 |         scanf("%d", &a[i]);
      |         ~~~~~^~~~~~~~~~~~~

Code

#include<iostream>
#include<cstdio>
#include<algorithm>
typedef long long LL;

using std::max;
const int N=200005;

int a[N];
LL f[N], big = 0;

void Test()
{
    freopen("temp\\in.txt", "r", stdin);
}
int main()
{
    // Test();
    int n;
    scanf("%d", &n);
    for(int i=1; i<=n; i++)
    {
        scanf("%d", &a[i]);

        f[i] = max(f[i-1]+a[i], (LL)a[i]);

        big = max(big, f[i]);
    }
    printf("%lld", big);

    return 0;
}

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:

input
10
-1 -1 -1 -1 -1 -1 -1 -1 -1 -1

correct output
-1

user output
0

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:

input
200000
-1 -1 -1 -1 -1 -1 -1 -1 -1 -1 ...

correct output
-1

user output
0

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:

input
1
-2

correct output
-2

user output
0

Test 13

Verdict:

input
5
-1 -1 -1 -1 -2

correct output
-1

user output
0

Test 14

Verdict:

input
2
-3 -2

correct output
-2

user output
0

Test 15

Verdict:

input
1
-1000000000

correct output
-1000000000

user output
0