QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#505231#7339. A Really Odd SequenceyundaehyuckAC ✓3910ms230176kbPython3490b2024-08-04 23:02:142024-08-04 23:02:15

Judging History

This is the latest submission verdict.

  • [2024-08-04 23:02:15]
  • Judged
  • Verdict: AC
  • Time: 3910ms
  • Memory: 230176kb
Show
  • [2024-08-04 23:02:14]
  • Submitted

answer

z = int(input())

for _ in range(z):

    n = int(input())

    A = list(map(int,input().split()))

    INF = 100000000000000000000000000

    dp = [[-INF]*2 for _ in range(n)]

    dp[0][0] = A[0]

    for i in range(1,n):

        dp[i][0] = max(A[i], dp[i-1][1] + A[i])
        dp[i][1] = dp[i-1][0] + A[i]
    
    answer = -INF

    for i in range(n):
        
        if answer < dp[i][0]:
            
            answer = dp[i][0]
    
    print(answer)
Source code, Language: Python3

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 12ms
memory: 10580kb

input:

1
4
8 -7 9 1

output:

10

result:

ok 1 number(s): "10"

Test #2:

score: 0
Accepted
time: 3910ms
memory: 230176kb

input:

59056
10
0 1 1 0 1 0 1 1 1 0
10
-1 -1 -1 1 0 0 1 0 0 1
10
1 0 0 1 1 1 -1 -1 0 1
10
-1 1 -1 1 0 1 1 0 -1 1
10
1 0 0 1 -1 0 -1 -1 -1 1
10
1 1 1 0 0 -1 -1 1 0 0
10
-1 1 0 0 1 -1 -1 0 -1 -1
10
1 -1 0 0 0 -1 -1 -1 -1 -1
10
0 0 0 1 1 0 0 1 -1 1
10
0 -1 0 0 1 0 1 1 1 0
10
0 0 0 0 1 -1 1 -1 -1 -1
10
-1 0 1 ...

output:

6
3
3
3
1
3
1
1
3
4
1
2
3
6
1
1
4
2
1
1
4
1
3
2
3
1
5
1
1
2
3
1
1
2
2
3
0
5
1
1
2
1
1
2
3
2
1
2
1
3
1
2
3
2
3
2
3
2
5
1
3
2
2
2
2
1
1
2
2
3
2
1
3
1
2
1
1
2
2
1
2
1
1
3
1
3
1
1
2
1
2
2
3
2
1
2
1
1
3
3
1
1
2
1
1
3
1
2
2
1
1
1
3
3
2
1
3
2
3
2
2
4
2
1
2
4
3
5
2
2
4
1
1
2
1
1
2
2
5
3
3
0
2
2
2
1
1
2
1
2
...

result:

ok 59056 numbers
English 繁體中文 简体中文

Server Time: 2025-02-08 21:05:00 | OpenSource Project