problem_id stringclasses 100
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 6 806 |
|---|---|---|---|
p02578 | s692911950 | Wrong Answer | n=int(input())
a=list(map(int,input().split()))
sm=0
b=a[0]
for i in range(1,n):
if a[i]<a[i-1]:
sm+=b-a[i]
else:
b=a[i]
print(sm)
|
p02578 | s060633010 | Wrong Answer | N = int(input())
A = list(map(int,input().split()))
K = 0
for i in range(0,N-2):
if A[i+1]-A[i]<0:
K += A[i+1]-A[i]
else:
K += 0
print(K)
|
p02578 | s914001037 | Wrong Answer | n = int(input())
A = list(map(int, input().split()))
x = A[0]
cnt = 0
for i in range(1, len(A)):
# if(A[i] > dp[i-1]+A[i-1]
if(A[i] <= A[i-1]):
cnt += x - A[i]
else:
x = A[i]
print(cnt) |
p02578 | s432606267 | Wrong Answer | n = int(input())
a = list(map(int, input().split()))
amax = max(a)
x = a.index(amax)
if x > 0:
bmax = max(a[:x])
else:
bmax = 0
ans = 0
for i in range(n):
if i < x:
ans += max(0, bmax-a[i])
else:
ans += max(0, amax-a[i])
print(ans)
|
p02578 | s482025068 | Wrong Answer | a=int(input())
b=list(map(int,input().split()))
c=0
for i in range(a-1):
if b[i]>b[i+1]:
b[i+1]=b[i+1]+1
c=c+1
print(c) |
p02578 | s391354663 | Wrong Answer | l=list(map(int,input().split()))
u=max(l)
d=0
i=0
while l[i]!=u:
if l[i]>l[i+1] and l[i]:
d=d+abs(l[i+1]-l[i])
l[i+1]=l[i]
i=i+1
r=i
for b in range(r,len(l)):
d=d+(u-l[b])
print(d)
|
p02578 | s781086156 | Wrong Answer | N=int(input())
A=list(map(int,input().split()))
s=0
if N==1:
print(0)
else:
for i in range(N-1):
if A[i+1]<A[i]:
s=s+A[i]-A[i+1]
A[i+1]=A[i]
print(s) |
p02578 | s383151800 | Wrong Answer | n = int(input())
a=list(map(int, input().split()))
ans = 0
print(len(a))
for i in range(n-1):
x = max(0, a[i] - a[i+1])
ans += x
a[i+1] += x
print(ans)
|
p02578 | s880863840 | Wrong Answer | N = int(input())
A = list(map(int,input().split()))
x = A[0]
ans = 0
for i in range(1,N):
if A[i] < x:
ans += x - A[i]
elif A[i] > x:
x = A[i]
print(x, ans)
print(ans) |
p02578 | s669630905 | Wrong Answer | def solve():
n = int(input())
a = list(map(int, input().split()))
mi = 0
le = len(a)
cost = 0
for i in range(le-1):
if a[i] > a[i+1]:
mi = max(a[i], mi)
cost += mi - a[i+1]
print(mi - a[i+1], mi)
cost += max(0, mi - a[-1])
print(cost)
return 0
if __name__ == "__main__":
solve() |
p02578 | s004173362 | Wrong Answer | n = int(input())
a = list(map(int,input().split()))
s = 0
for i in range(n-1):
e = a[i+1]-a[i]
if e > 0:
s += e
else:
continue
print(s) |
p02578 | s710747003 | Wrong Answer | N = int(input())
An = [int(val) for val in input().split()]
# 各踏み台を初期化
Fn = [0 for _ in range(N)]
an_1 = An[0]
fn_1 = 0
for i in range(1, N):
an = An[i]
fn = max(0, an - an_1 - fn_1)
Fn[i] = fn
fn_1 = fn
an_1 = an
sum = 0
for fi in Fn:
sum += fi
print(sum)
|
p02578 | s322298676 | Wrong Answer | n = int(input())
a_list = list(map(int, input().split()))
h_list = [0]*(n+10)
for i in range(1,len(a_list)):
if a_list[i] < a_list[i-1]:
h_list[i] = a_list[i-1] + h_list[i-1] - a_list[i]
elif a_list[i] >= a_list[i-1]:
h_list[i] = 0
print(sum(h_list)) |
p02578 | s402229843 | Wrong Answer | N = int(input())
A = [int(i) for i in input().split()]
s = [0]*N
for i,n in enumerate(A):
if i == 0:
continue
s[i] = max(0, A[i-1] + s[i-1] - A[i])
print(sum(s))
print(s) |
p02578 | s118665483 | Wrong Answer | N = input()
A = []
A = input().split()
j = 0
t = A[0]
for i in A:
if t>i:
j += int(t)-int(i)
if t<i:
t = i
print(j) |
p02578 | s221149081 | Wrong Answer | n = int(input())
a = list(map(int, input().split()))
count = 0
for i, j in enumerate(a):
try:
if j < a[i - 1]:
b = a[i - 1] - j
count += b
else:
pass
except IndexError:
pass
print(count)
|
p02578 | s967631304 | Wrong Answer | n=int(input())
a=list(map(int, input().split()))
ans=0
for i in range(1, n):
s=a[i] - a[i-1]
if s<0:
ans-=s
a[i]-=s |
p02578 | s025642610 | Wrong Answer | N = int(input())
A = list(map(int, input().split()))
min_step = 10**9
step = 0
for i in range(N-1):
if A[i] <= A[i+1]:
step = A[i+1] - A[i]
for j in range(N-1):
if step + A[j] < A[j+1]:
break
else:
min_step = min(min_step, step)
print(min_step) |
p02578 | s598427986 | Wrong Answer | n = int(input())
a = list(map(int,input().split()))
b = []
c = 0
for i in range(1,n):
s = a[i-1]-a[i]
if s >= 0:
s = s+c
b.append(s)
c = max(c,s)
else:
c = 0
b.append(c)
print(b) |
p02578 | s402202624 | Wrong Answer | if __name__ == "__main__":
n = int(input())
x =list((int(x) for x in input().split()))
print(x)
tmp1 = 0
tmp2 = x[0]
for i in range(1,n):
if tmp2 > x[i]:
tmp3 = tmp2 - x[i]
tmp1 += tmp3
x[i] = x[i] + tmp3
print(tmp1)
|
p02578 | s422593904 | Wrong Answer | from sys import stdin
length = int(stdin.readline())
heights = list(stdin.readline().replace(" ", ""))
stool = 0
for i in range(1, length):
if heights[i-1] > heights[i]:
stool += (int(heights[i-1]) - int(heights[i]))
heights[i] = heights[i-1]
print(int(stool)) |
p02578 | s912772716 | Wrong Answer | n = int(input())
a = [int(i) for i in input().split()]
ans = 0
step = 0
for x in range(n):
while a[x-1] > a[x]+step:
step += 1
else:
ans = ans + step
step = 0
print(ans) |
p02578 | s075005064 | Wrong Answer | n=int(input())
l=list(map(int,input().split()))
tmp=l[0]
ans=0
for i in range(n-1):
if l[i+1]<=l[i]:
ans+=(tmp-l[i+1])
else:
tmp=l[i+1]
print(ans) |
p02578 | s545803103 | Wrong Answer | N = int(input())
lst = list(map(int, input().split()))
lst2 = sorted(set(lst), reverse=True)
l_count = N
count = 0
for i in lst2:
k_index = lst.index(i)
count += (l_count - k_index) * i
l_count = k_index
print(count-sum(lst)) |
p02578 | s303492210 | Wrong Answer | N = int(input())
A = list(map(int, input().split()))
pre = A[0]
ans = 0
for a in A[1:]:
if pre > a:
ans += pre - a
pre = a
print(ans) |
p02578 | s924698233 | Wrong Answer | n=int(input())
A=list(map(int,input().split()))
ans=0
for i in range(1,n):
d=A[i]-A[i-1]
if d>0:
ans += d
A[i]+=d
print(ans) |
p02578 | s928019059 | Wrong Answer | n=int(input())
l = list(map(int,input().split()))
s=0
for i in range(n):
if int(l[i-1])>int(l[i]):
p=int(l[i-1])-int(l[i])
s+=p
print(s) |
p02578 | s961230570 | Wrong Answer | N = int(input())
A = list(map(int, input().split()))
out = 0
for i in range(1, N):
d = max(A[i] - A[i-1], 0)
out += d
A[i] += d
print(int(out)) |
p02578 | s608330433 | Wrong Answer | n = int(input())
a = list(map(int,input().split()))
b = []
c = 0
for i in range(1,n):
s = a[i-1]-a[i]
if s > 0:
s = s+c
b.append(s)
c = s
else:
c = 0
print(sum(b)) |
p02578 | s341782160 | Wrong Answer | import numpy as np
N=int(input())
A=list(map(int,input().split()))
sum=0
for i in range(N-1):
if A[i+1]-A[i]<0:
sum+=max(A[:i+1])-A[i+1]
print(sum) |
p02578 | s951624559 | Wrong Answer | n=int(input())
a=list(map(int,input().split()))
b=a
s=0
for i in range(n-1):
if b[i]>a[i+1]:
s+=(a[i]-a[i+1])
b[i+1]=b[i]
print(s,a,b) |
p02578 | s623780978 | Wrong Answer | n = int(input())
A = list(map(int, input().split()))
a=0
result=0
for i in range(n):
if A[i-1] > A[i]:
a = A[i-1] - A[i]
result += a
print(result) |
p02578 | s048983077 | Wrong Answer | N = int(input())
A = list(input().split())
An = [int(num) for num in A]
print(An)
sum = 0
for i in range(1,N):
if An[i-1]<=An[i]:
continue
else:
sum += (An[i-1]-An[i])
An[i] = An[i-1]
print(sum) |
p02578 | s432461227 | Wrong Answer | N = input()
A = input().split()
S = int(min(A))
L = int(max(A))
print(L-S) |
p02578 | s329416228 | Wrong Answer | def main():
n = int(input())
a = list(map(int, input().split()))
cnt = 0
for i in range(0, n-1):
if a[i] < a[i+1]:
step = a[i+1] - a[i]
a[i] = a[i] + step
cnt = cnt+step
print(cnt)
main() |
p02578 | s844373791 | Wrong Answer | N=int(input())
A = list(map(int, input().split()))
#print(A)
count=0
count2=0
for i in range(len(A)-1):
if A[i]>A[i+1]:
count=A[i]-A[i+1]
#print(count)
A[i+1]=A[i]
count2+=count
print(count2) |
p02578 | s759152591 | Wrong Answer | N = int(input())
A = list(map(int, input().split()))
sa = 0
i = 0
mx = max(A)
flg = 0
while i < len(A)-1:
if (A[i] < mx) and A[i] > A[i+1] and flg != 1:
sa += A[i]-A[i+1]
elif A[i] == mx:
sa += mx-A[i+1]
flg = 1
elif flg == 1:
sa += mx-A[i+1]
i += 1
print(sa) |
p02578 | s078028979 | Wrong Answer | N = int(input())
heights = list(map(int, input().split()))
steps = [0] * N
for i in range(1, N):
if heights[i-1] + steps[i-1] > heights[i]:
steps[i] = 0
else:
steps[i] = heights[i] - (heights[i-1] + steps[i-1])
print (sum(steps)) |
p02578 | s660818473 | Wrong Answer | N = int(input())
A = [0]*N
A = list(map(int, input().split()))
sum_step = 0
for n in range(0, N):
if A[n] >= A[n-1]:
pass
else:
sum_step += A[n-1] - A[n]
A[n] = A[n-1]
print(sum_step) |
p02578 | s210120721 | Wrong Answer | n = int(input())
H = list(map(int, input().split()))
mh = 0
cnt = 0
for i in range(n - 1):
mh = max(mh, H[i])
if H[i] <= H[i + 1]:
continue
else:
if H[i + 1] < H[i]:
cnt += mh - H[i + 1]
print(cnt)
|
p02578 | s957818568 | Wrong Answer | N=int(input())
A=list(map(int,input().split()))
a=0
s=[]
for i in A:
if i<a:
s.append(i-a)
a=i
else:
a=i
print(sum(s)) |
p02578 | s775005864 | Wrong Answer | n=int(input())
a=list(map(int,input().split()))
ans=0
for i in range(1,n):
if a[i]>a[i-1]:
ans+=a[i]-a[i-1]
print(ans) |
p02578 | s327062190 | Wrong Answer | n=int(input())
arr=list(map(int,input().split(" ")))
s=0
for i in range(n-1,0,-1):
if arr[i]>arr[i-1]:
s+= arr[i]-arr[i-1]
print(s) |
p02578 | s278446370 | Wrong Answer | N = int(input())
A = list(map(int, input().split()))
c = 0
for i in range(1, N):
b = A[i-1]
c += A[i] - b if A[i] > b else 0
print(c)
|
p02578 | s923282602 | Wrong Answer | n = int(input())
As = list(map(int, input().split()))
r = 0
for a in range(len(As)-1, -1, -1):
if As[a] < As[a-1]:
r += As[a-1] - As[a]
print(r)
|
p02578 | s890963355 | Wrong Answer | n = int(input())
arr = list(map(int,input().split()))
res = [0]*n
for i in range(1, n):
if arr[i] < arr[i-1]:
res[i] += (res[i-1] + abs(arr[i-1]-arr[i]))
print(sum(res)) |
p02578 | s729863953 | Wrong Answer | N = int(input())
A = list(map(int,input().split()))
total=0
for i in range(N):
if A[i]<A[i-1]:
total+=A[i-1]-A[i]
print(total) |
p02578 | s524161621 | Wrong Answer | N = int(input(''))
A = input('')
A_N = A.split()
num = 0
for i in range(1,N):
if int(A_N[i]) >= int(A_N[i-1]):
num += 0
elif (A_N[i]) < (A_N[i-1]):
num += int(A_N[i-1]) - int(A_N[i])
print(num) |
p02578 | s518138432 | Wrong Answer | N = int(input())
numbers = input().split()
numbers = list(map(int,numbers))
m = 0
gross_count = 0
for n in numbers:
if m > n:
gross_count += (m-n)
print(gross_count)
else:
m = n
print(gross_count) |
p02578 | s451758476 | Wrong Answer | N = int(input())
A = list(map(int, input().split()))
A.reverse()
step = 0
ans = 0
max_step = 0
for i in range(N):
for j in range(i, N):
if A[i] - A[j] > 0:
step = A[i] - A[j]
max_step = max(max_step, step)
ans += max_step
print(ans) |
p02578 | s672517981 | Wrong Answer | num = int(input())
height = list(map(int,input().split()))
count = 0
for i in range(len(height) - 1):
while height[i] < height[i + 1]:
height[i] += 1
count += 1
print(count) |
p02578 | s713322866 | Wrong Answer | N = int(input())
A = list(map(int, input().split()))
pre = A[0]
ans = 0
if N == 1:
print(0)
else:
for a in A[1:]:
print(ans)
if pre > a:
ans += pre - a
else:
pre = a
print(ans) |
p02578 | s430130253 | Wrong Answer | def main():
n = int(input())
a = list(map(int, input().split()))
cnt = 0
for i in range(0, n-1):
if a[i] < a[i+1]:
step = a[i+1] - a[i]
cnt = cnt+step
a[i] = a[i] + step
print(cnt)
main() |
p02578 | s091789768 | Wrong Answer | N = int(input())
A = list(map(int, input().split()))
max_num = 0
for num in A:
if num > max_num:
max_num = num
border = A.index(max_num)
height = []
before_h = A[0]
for h in A[:border]:
if before_h <= h:
height.append(0)
elif before_h > h:
height.append(before_h-h)
before_h = h
for h in A[border:]:
height.append(max_num-h)
print(sum(height))
|
p02578 | s560826771 | Wrong Answer | n = int(input())
lst = list(map(int,input().split()))
ans = 0
for i in range(n):
tall = 0
for j in range(i):
if (lst[j] > tall):
tall = lst[j]
print (i, tall)
if (lst[i] < tall):
sa = tall - lst[i]
print(i,sa)
ans = ans + sa
lst[i] = tall
print(ans)
|
p02578 | s389708458 | Wrong Answer | n = int(input())
a = input().split()
s = 0
for i in range(n-1):
s+=max(int(a[i+1])-int(a[i]), 0)
print(s) |
p02578 | s092299993 | Wrong Answer | N = int(input())
A = [0]*N
A = list(map(int, input().split()))
sum_step = 0
for n in range(1,N):
if A[n] < A[n-1]:
sum_step += A[n-1] - A[n]
A[n] = A[n-1]
print(sum_step) |
p02578 | s197011096 | Wrong Answer | n=int(input())
l = list(map(int,input().split()))
s=0
for i in range(n):
if l[i-1]>l[i]:
p=int(l[i-1])-int(l[i])
s+=p
print(s) |
p02578 | s401267727 | Wrong Answer | n = int(input())
a = list(map(int,input().split()))
list_ans = []
for j in range(1,n):
stepping_stone = a[j] - a[j-1]
if stepping_stone > 0:
list_ans.append(stepping_stone)
else:
list_ans.append(0)
ans = sum(list_ans)
print(ans) |
p02578 | s748291756 | Wrong Answer | def main():
n = int(input())
As = list(map(int, input().split()))
r = 0
sortAs = sorted(As)
max_a = sortAs[-1]
for i in range(n-1, -1, -1):
if i == 0:
break
if As[i] < As[i-1]:
if(max_a not in As[0:i-1]):
max_a = As[i-1]
r += max_a - As[i]
print(r)
main()
|
p02578 | s551329003 | Wrong Answer | def main():
n = int(input())
a = list(map(int, input().split(" ")))
top = a[0]
ans = 0
for height in a:
if top < height:
ans += height - top
top = height
print(ans)
main()
|
p02578 | s206050016 | Wrong Answer | n = int(input())
a = list(map(int, input().split()))
l = []
for i in range(0, n-1):
if(a[i] > a[i+1]):
l.append(a[i]-a[i+1])
else:
l.append(0)
for i in range(0, len(l)-1):
if((l[i] > 0) and (l[i+1] != 0)):
l[i+1] = l[i+1] + l[i]
print(sum(l))
|
p02578 | s054810331 | Wrong Answer | num = int(input())
line = list(map(int,input().split()))
mini = line[0]
x = 0
for i in range(1,num):
if mini > line[1]:
x += 1
else:
mini = line[i]
print(x) |
p02578 | s455331647 | Wrong Answer | a=int(input())
b=input().split(' ')
print(int(max(b))-int(min(b))) |
p02578 | s305665154 | Wrong Answer | N = input()
A = []
A = input().split()
j = 0
t = A[0]
for i in A:
if t>i:
j += int(t)-int(i)
if t<=i:
t = i
print(j) |
p02578 | s349853620 | Wrong Answer | # AtCoder Beginner Contest 176
# C - Step
N=int(input())
Als=list(map(int,input().split()))
ans=0
for i in range (1,N):
if Als[i]>=Als[i-1]:
pass
else :
ans+= max(Als[0:i])
print(ans) |
p02578 | s826420973 | Wrong Answer | N=int(input())
a=input().split()
A=list(map(int,a))
#print(A)
tmp=0
count=0
for i in range(N):
if(i==0):
tmp=A[0]
if(tmp<=A[i]):
#print(A[i])
tmp=A[i]
else:
count+=1
print(count)
|
p02578 | s357658545 | Wrong Answer | n = int(input())
a = [int(_) for _ in input().split()]
ans = 0
h = a[0]
if n == 1:
print(0)
else:
for i in range(1, n):
if a[i] < h:
ans += h - a[i]
else:
h = a[i]
print(ans) |
p02578 | s500120616 | Wrong Answer | n=int(input())
l=list(map(int,input().split()))
ans=0
maxt=0
for i in l:
if i<maxt:
ans+=maxt-i
maxt=max(i,maxt)
print(ans)
|
p02578 | s363037238 | Wrong Answer | tot = int(input())
ls = list(map(int,input().split()))
ans = 0
mx = 0
for i in range(0,tot):
if mx < ls[i]:
mx = ls[i]
if i != 0:
if ls[i] < ls[i-1]:
ans += mx - ls[i]
print(ans) |
p02578 | s316003671 | Wrong Answer | n=int(input())
l=list(map(int,input().split()))
tmp=l[0]
ans=0
for i in range(n-1):
if l[i+1]<l[i]:
ans+=(tmp-l[i+1])
else:
tmp=l[i+1]
print(ans) |
p02578 | s712038755 | Wrong Answer | l=list(map(int,input().split()))
u=max(l)
d=0
i=0
while l[i]!=u:
if l[i]>l[i+1]:
d=d+abs(l[i+1]-l[i])
i=i+1
r=i
for b in range(r,len(l)):
d=d+(u-l[b])
print(d)
|
p02578 | s565965117 | Wrong Answer | n = int(input())
a = [int(s) for s in input().split()]
count = 0
max = a[0]
for i in range(1, len(a)):
if a[i - 1] > a[i]:
if a[i - 1] > max:
max = a[i - 1]
count += max - a[i]
else:
max = a[i]
print(count) |
p02578 | s554254857 | Wrong Answer | N = int(input())
A = [0]*N
A = list(map(int, input().split()))
sum_step = 0
for n in range(1, N):
if A[n] >= A[n-1]:
pass
else:
sum_step += A[n-1] - A[n]
print(sum_step) |
p02578 | s252760718 | Wrong Answer | def solve():
n = int(input())
a = list(map(int, input().split()))
mi = 0
le = len(a)
cost = 0
for i in range(le-1):
if a[i] > a[i+1]:
mi = max(a[i], mi)
cost += mi - a[i+1]
print(mi - a[i+1], mi)
print(cost)
return 0
if __name__ == "__main__":
solve() |
p02578 | s523580476 | Wrong Answer | N = int(input())
A = list(map(int, input().split()))
c = 0
for i in range(1, N):
b = A[i-1]
c += A[i] - b
print(c) |
p02578 | s865062059 | Wrong Answer |
N = int(input())
A = list(map(int, input().split()))
ans = 0
for i in range(1,N):
tmp = A[i-1] - A[i]
if A[i-1] > A[i]:
A[i] += tmp
ans += tmp
print(A)
print(ans)
|
p02578 | s446182116 | Wrong Answer | N = int(input())
A = list(map(int,input().split()))
ans = 0
for i in range(N):
if(i == 0):
pass
else:
if(A[i] - A[i-1] <= 0):
pass
else:
ans += A[i] - A[i-1]
print(ans) |
p02578 | s204436368 | Wrong Answer | n = int(input())
H = list(map(int, input().split()))
mh = 0
ans = 0
for i in range(n - 1):
mh = max(mh, H[i])
if H[i] <= H[i + 1]:
continue
else:
if H[i + 1] < H[i]:
ans = max(ans, mh - H[i + 1])
print(ans)
|
p02578 | s086386369 | Wrong Answer | n = int(input())
As =list(map(int,input().split()))
sum = 0
step =0
try:
for i in range(n):
if As[i] > As[i + 1]:
step = As[i] - As[i + 1]
As[i + 1] += step
sum += step
except IndexError:
pass
for i in range(len(As)):
print(As[i],end=" ")
else:
print("")
print(sum) |
p02578 | s170202092 | Wrong Answer | n = int(input())
As = list(map(int, input().split()))
mx = 0
prev = -1
ans = 0
for a in As:
if prev < a:
mx = a
else:
ans += mx - a
prev = a
print(ans) |
p02578 | s256502540 | Wrong Answer | n = int(input())
l = list(map(int,input().split()))
sum=0
l.sort()
for i in range(len(l)-1):
if l[i+1]>l[i]:
sum+=l[i+1]-l[i]
print(sum)
|
p02578 | s360668569 | Wrong Answer | n = int(input())
As =list(map(int,input().split()))
sum = 0
step =0
for i in range(n):
try:
if As[i] > As[i + 1]:
step = As[i] - As[i + 1]
As[i + 1] += step
sum += step
except IndexError:
continue
for i in range(len(As)):
print(As[i],end=" ")
else:
print("")
print(sum) |
p02578 | s696940033 | Wrong Answer | n = int(input())
lst = list(map(int, input().split()))
count = 0
t = 0
for i in range(n-1):
if lst[i] < lst[i+1]:
t += lst[i+1] - lst[i]
count += t
lst[i+1] = t
print(count)
|
p02578 | s554181071 | Wrong Answer | N = int(input())
A = list(map(int, input().split()))
ans = 0
tgt = A[0]
for i in range(1, N):
if A[i-1] < A[i]:
tgt = A[i]
elif A[i-1] > A[i]:
ans += tgt - A[i]
print(ans) |
p02578 | s675851420 | Wrong Answer | n = int(input())
a = list(map(int,input().split()))
ans = 0
m = a[0]
for i in range(1,n):
if a[i] > m:
ans += a[i]-m
m = a[i]
print(ans)
|
p02578 | s539204311 | Wrong Answer | N = int(input())
A = list(map(int, input().split()))
mini = A[0]
ans = 0
for i in range(len(A) - 1):
if A[i] < A[i+1]:
ans += A[i+1] - A[i]
A[i] = A[i+1]
print(ans) |
p02578 | s223095808 | Wrong Answer | def resolve():
N = input()
string = input()
max_height = 0
s = 0
for c in string:
if c == " ":
continue
h = int(c)
if h < max_height:
s += max_height - h
elif h > max_height:
max_height = h
print(s)
resolve() |
p02578 | s063539164 | Wrong Answer | n=int(input())
a=list(map(int,input().split()))
b=[]
if n>1:
for j in range (n-1):
c=a[j]-a[j+1]
b.append(c)
a[j+1]=a[j+1]+c
if max(b)>-1:
print(max(b))
else:
print(0)
else:
print(0)
|
p02578 | s136878412 | Wrong Answer | _ = input()
li = list(map(int,input().split()))
ans=0
while li!=[] and li!=sorted(li):
maxValue = max(li)
maxLocation = li.index(maxValue)
li_removed = li[maxLocation:]
li = li[:maxLocation]
li_removed.sort()
print(li_removed)
for i in li_removed[:li_removed.index(maxValue)-1]:
ans = ans + (maxValue - i)
print(ans) |
p02578 | s596101195 | Wrong Answer | n = int(input())
a_list = list(map(int, input().split()))
h_list = [0]*(n+10)
for i in range(1,n):
if a_list[i] < a_list[i-1]:
h_list[i] = a_list[i-1] + h_list[i-1] - a_list[i]
elif a_list[i] >= a_list[i-1]:
h_list[i] = 0
print(sum(h_list)) |
p02578 | s411726502 | Wrong Answer | N = int(input())
A = list(map(int, input().strip().split()))
ans = 0
for i in range(1, N):
ans += max(0, A[i] - A[i - 1])
A[i] = max(A[i], A[i - 1])
print(ans) |
p02578 | s006434403 | Wrong Answer | n = int(input())
a = list(map(int,input().split()))
cnt = 0
for i in range(n-1):
if a[i+1] > a[i]:
cnt += a[i+1]-a[i]
print(cnt) |
p02578 | s644326198 | Wrong Answer | n = int(input())
a = list(map(int, input().split()))
res = a[0]
ans = 0
for i in range(n-1):
if a[i]>=a[i+1]:
ans += res-a[i+1]
else:
res = a[i+1]
print(ans) |
p02578 | s166289124 | Wrong Answer | n = input()
print(n) |
p02578 | s009738840 | Wrong Answer | def stepUp(val_list):
counter = 0
for i in range(len(val_list) - 1):
current = val_list[i]
up = val_list[i + 1]
if (current > up):
counter += current - up
if (val_list[len(val_list) - 2] > val_list[len(val_list) -1]):
counter += val_list[len(val_list) - 2] - val_list[len(val_list) -1]
return counter
def userInput():
a_count = int(input())
a = list(map(int, input().rstrip().split()))
return stepUp(a)
print(userInput()) |
p02578 | s709520572 | Wrong Answer | n = int(input())
a = list(map(int, input().split()))
count = 0
for i, j in enumerate(a):
try:
if j < a[i - 1]:
b = a[i - 1] - j
count += b
j += b
else:
pass
except IndexError:
pass
print(count)
|
p02578 | s130743994 | Wrong Answer | n=int(input())
l=list(map(int,input().split()))
s=0
p=0
for i in range(n):
h_need=p+l[i-1]
if h_need>l[i]:
p=h_need-l[i]
s+=p
else:h_need=l[i-1]
print(s) |
p02578 | s147408156 | Wrong Answer | n = int(input())
a = list(map(int, input().split()))
amax = max(a)
x = a.index(amax)
if x > 0:
bmax = max(a[:x])
y = a.index(bmax)
else:
bmax = 0
y = 0
ans = 0
for i in range(n):
if i >= y and i < x:
ans += max(0, bmax-a[i])
elif i >= x:
ans += max(0, amax-a[i])
print(ans)
|
p02578 | s036307965 | Wrong Answer | n=int(input())
a=list(map(int,input().split()))
s=max(a)
k=0
for i in range(0,(a.index(s))):
if a[i]>a[i+1]:
k+= (a[i] - a[i+1])
else:
continue
for i in range(a.index(s),n):
if a[i]<s:
k+= s-a[i]
else:
continue
print(k) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.