| Task: | Increasing Array |
| Sender: | toothfairy |
| Submission time: | 2020-09-26 13:34:04 +0300 |
| Language: | Python3 (CPython3) |
| Status: | READY |
| Result: | ACCEPTED |
| test | verdict | time | |
|---|---|---|---|
| #1 | ACCEPTED | 0.02 s | details |
| #2 | ACCEPTED | 0.02 s | details |
| #3 | ACCEPTED | 0.02 s | details |
| #4 | ACCEPTED | 0.14 s | details |
| #5 | ACCEPTED | 0.26 s | details |
| #6 | ACCEPTED | 0.30 s | details |
| #7 | ACCEPTED | 0.02 s | details |
Code
n = int(input())
value = input()
arr = value.split()
counter = 0
arr[0] = int(arr[0])
for i in range(n-1):
arr[i+1] = int(arr[i+1])
if arr[i] > arr[i+1]:
diff = arr[i] - arr[i+1]
arr[i+1] = arr[i+1]
arr[i+1] +=diff
counter+= diff
print(counter)
Test details
Test 1
Verdict: ACCEPTED
| input |
|---|
| 10 1 1 1 1 1 1 1 1 1 1 |
| correct output |
|---|
| 0 |
| user output |
|---|
| 0 |
Test 2
Verdict: ACCEPTED
| input |
|---|
| 10 1000000000 1 1 1 1 1 1 1 1 1 |
| correct output |
|---|
| 8999999991 |
| user output |
|---|
| 8999999991 |
Test 3
Verdict: ACCEPTED
| input |
|---|
| 10 6 10 4 10 2 8 9 2 7 7 |
| correct output |
|---|
| 31 |
| user output |
|---|
| 31 |
Test 4
Verdict: ACCEPTED
| input |
|---|
| 200000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
| correct output |
|---|
| 0 |
| user output |
|---|
| 0 |
Test 5
Verdict: ACCEPTED
| input |
|---|
| 200000 1000000000 1 1 1 1 1 1 1 1 1 1... |
| correct output |
|---|
| 199998999800001 |
| user output |
|---|
| 199998999800001 |
Test 6
Verdict: ACCEPTED
| input |
|---|
| 200000 763977854 530688450 486447012 ... |
| correct output |
|---|
| 100126194120455 |
| user output |
|---|
| 100126194120455 |
Test 7
Verdict: ACCEPTED
| input |
|---|
| 1 329873232 |
| correct output |
|---|
| 0 |
| user output |
|---|
| 0 |
