QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #555597 | #8586. Party | mohamed_ioi | 0 | 16ms | 10696kb | Python3 | 253b | 2024-09-10 06:03:53 | 2024-09-10 06:03:54 |
Judging History
answer
n= int(input())
a = list(map(int, input().split(' ')))
if n == 1:
print(a[0])
else:
dp = [0] * n
dp[0] = a[0]
dp[1] = max(a[1], a[0])
for i in range(2, n):
dp[i] = max(a[i] + dp[i - 2], a[i] + dp[i-1])
print(dp[n - 1])
Details
Tip: Click on the bar to expand more detailed information
Subtask #1:
score: 0
Wrong Answer
Test #1:
score: 49
Accepted
time: 15ms
memory: 10584kb
input:
5 3 2 -1 4 5
output:
12
result:
ok single line: '12'
Test #2:
score: 49
Accepted
time: 16ms
memory: 10696kb
input:
1 10
output:
10
result:
ok single line: '10'
Test #3:
score: 0
Wrong Answer
time: 15ms
memory: 10584kb
input:
6 1 -3 2 10 -4 9
output:
22
result:
wrong answer 1st lines differ - expected: '21', found: '22'
Subtask #2:
score: 0
Skipped
Dependency #1:
0%
Subtask #3:
score: 0
Skipped
Dependency #1:
0%