input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
N = int(eval(input()))
A = list(map(int,input().split()))
A = sorted(A,reverse=True)
ans = A[0]
for i in range(1,(N-2)//2+1):
ans += A[i]*2
if N % 2 == 1:
ans += A[(N-2)//2 + 1]
print(ans) | N = int(eval(input()))
A = list(map(int,input().split()))
A = sorted(A,reverse=True)
if N <= 3:
ans = sum(A[:-1])
elif N % 2 == 0:
ans = A[0] + sum(A[1:(N-2)//2+1])*2
elif N % 2 == 1:
ans = A[0] + sum(A[1:(N-2)//2+1])*2 + A[1+(N-2)//2]
print(ans)
| p02615 |
import heapq
N = 4
ARR = [2, 2, 1, 3]
N = 7
ARR = [1, 1, 1, 1, 1, 1, 1]
N = int(eval(input()))
ARR = list(map(int,input().split()))
def calculate(n,arr):
arr = sorted(arr,reverse=True)
arr = [-1 * ar for ar in arr]
mmk = []
ans = 0
for i in range(n):
if i == 0:
heapq.heappush(mmk,arr[i])
continue
ans -= heapq.heappop(mmk)
heapq.heappush(mmk,arr[i])
heapq.heappush(mmk,arr[i])
print(ans)
calculate(N, ARR) | N = 4
ARR = [2, 2, 1, 3]
N = 7
ARR = [1, 1, 1, 1, 1, 1, 1]
N = int(eval(input()))
ARR = list(map(int,input().split()))
# 3 2 2 1
def calculate(n, arr):
endIndex = 0
ans = 0
arr = sorted(arr, reverse=True)
for i in range(n):
if i == 0:
ans += arr[i]
endIndex += 1
continue
endIndex += 1
if endIndex >= n:
break
ans += arr[i]
endIndex += 1
if endIndex >= n:
break
ans += arr[i]
print(ans)
calculate(N, ARR)
| p02615 |
N = int(eval(input()))
A = list(map(int,input().split()))
A = sorted(A)
ans = [A[-1]]
com = 0
for i in range(2,N+1) :
com += ans[-1]
del ans[-1]
ans.append(A[-i])
ans.append(A[-i])
ans = sorted(ans)
print(com)
| N = int(eval(input()))
A = list(map(int,input().split()))
A = sorted(A)
ans = 0
for i in range(1,N) :
ans += A[N-1 - i//2 ]
print(ans)
| p02615 |
# 貪欲に大きい順に入れていって，入れる場所はもっとも周りが大きくなる場所
# この方針は正しいただし，値の取り出しだけではなく挿入が起こるので，優先度付きキュー（heap）を使う必要があるっ
N = int(eval(input()))
A = list(map(int,input().split()))
A.sort(reverse=True)
import heapq
C = []
# heapは最小値しか取り出せないことに注意
heapq.heapify(C)
ans = 0
# 初期条件として2つの値を挿入する
heapq.heappush(C,-A[0])
for i in range(1,N):
tmp = heapq.heappop(C)
ans += -tmp
heapq.heappush(C, -A[i])
heapq.heappush(C, -A[i])
print(ans)
| N = int(eval(input()))
A = list(map(int,input().split()))
A.sort(reverse=True)
ans = 0
for i in range(N-1):
if i == 0:
ans += A[i]
else:
ans += A[1+(i-1)//2]
print(ans) | p02615 |
n = int(eval(input()))
a = list(map(int,input().split()))
a.sort(reverse=True)
dic = {a[0]:1}
ans = 0
for i in range(1,n):
h = a[i]
max_h = list(dic)[0]
if h == max_h:
dic[h] += 1
ans += h
else:
if h in dic:
dic[h] += 2
dic[max_h] -= 1
ans += max_h
else:
dic[h] = 2
dic[max_h] -= 1
ans += max_h
if dic[max_h] == 0:
del dic[max_h]
print(ans)
| n = int(eval(input()))
a = list(map(int,input().split()))
a.sort(reverse=True)
dic = {a[0]:1}
ans = 0
for i in range(1,n):
h = a[i]
max_h = next(iter(dic))
if h == max_h:
dic[h] += 1
ans += h
else:
if h in dic:
dic[h] += 2
dic[max_h] -= 1
ans += max_h
else:
dic[h] = 2
dic[max_h] -= 1
ans += max_h
if dic[max_h] == 0:
del dic[max_h]
print(ans)
| p02615 |
N = int(eval(input()))
A = list(map(int, input().split()))
A.sort(reverse=True)
ring = [A[0], A[1]]
ans = A[0]
for i in range(2, N):
max_tmp = 0
num_tmp = 0
for j in range(len(ring) - 1):
if max_tmp < min(ring[j], ring[j + 1]):
max_tmp = min(ring[j], ring[j + 1])
num_tmp = j + 1
if max_tmp < min(ring[0], ring[-1]):
max_tmp = min(ring[0], ring[-1])
num_tmp = -1
if num_tmp == -1:
ring.append(A[i])
else:
ring.insert(num_tmp, A[i])
ans += max_tmp
print(ans) | N = int(eval(input()))
A = list(map(int, input().split()))
A.sort(reverse=True)
ans = A[0]
s = (N - 2) // 2
if s > 0:
ans += sum(A[1:1 + s]) * 2
if (N - 2) % 2:
ans += A[1 + s]
print(ans) | p02615 |
if __name__ == '__main__':
n = int(input().strip())
A = list(map(int, input().strip().split()))
A.sort(reverse=True)
score = 0
if not len(A) < 2:
min_max_list = [0] * n
min_max_dict = {A[1]: 2}
max_value = A[1]
score = A[0]
value_list = [A[1]]
for num, a in enumerate(A[2:]):
score += max_value
min_max_dict[max_value] -= 1
if a in min_max_dict:
min_max_dict[a] += 2
else:
min_max_dict[a] = 2
value_list.append(a)
if min_max_dict[max_value] == 0:
del(value_list[0])
max_value = value_list[0]
print(score)
| if __name__ == '__main__':
n = int(input().strip())
A = list(map(int, input().strip().split()))
A.sort(reverse=True)
score = A[0] + sum([A[1+int(i/2)]for i in range(0, n-2)])
print(score)
| p02615 |
import collections
N=int(eval(input()))
A=list(map(int,input().split()))
A=sorted(A,reverse=True)
c=collections.Counter(A)
x=2*c[A[0]]-1
if x>N-1:
print((sum(A)-A[0]))
exit()
ans=A[0]*(2*c[A[0]]-1)
while x<N-1:
A=A[c[A[0]]:]
x+=2*c[A[0]]
ans+=A[0]*2*c[A[0]]
y=x-N+1
ans-=y*A[0]
print(ans)
| N=int(eval(input()))
A=list(map(int,input().split()))
A=sorted(A,reverse=True)
ans=0
for i in range(1,N):
ans+=A[i//2]
print(ans)
| p02615 |
N = int(eval(input()))
lsA = list(map(int,input().split()))
lsA += lsA
lsA.sort(reverse=True)
lsA.pop(0)
ans = 0
for i in range(N-1):
ans += lsA.pop(0)
print(ans) | N = int(eval(input()))
lsA = list(map(int,input().split()))
lsA += lsA
lsA.sort(reverse=True)
lsA.pop(0)
ans = sum(lsA[:N-1])
print(ans) | p02615 |
N = int(eval(input()))
A_list = list(map(int,input().split()))
A_list.sort(reverse = True)
cmfrt = 0
mx_cmfrt = 0
counter = 0
reached_list = [A_list[0],A_list[0]]
for j in range(1, len(A_list)):
for i in range(1, len(reached_list)):
cmfrt = min(reached_list[i-1], reached_list[i])
if cmfrt > mx_cmfrt:
mx_cmfrt = cmfrt
insrt_pst = i
reached_list.insert(insrt_pst,A_list[j])
counter += mx_cmfrt
mx_cmfrt = 0
print(counter) | import math
N = int(eval(input()))
A = list(map(int,input().split()))
A.sort(reverse = True)
score = A[0]
for i in range(1, math.ceil(N*0.5)):
if N - i * 2 != 1:
score += 2 * A[i]
else:
score += A[i]
print(score) | p02615 |
N = int(eval(input()))
A = list(map(int, input().split()))
A.sort(reverse=True)
edge = {}
edge[0, 1] = min(A[0], A[1])
edge[1, 0] = min(A[0], A[1])
ans = A[0]
max_edge_list = [(0, 1), (1, 0)]
for i in range(2, N):
x, y = max_edge_list[0]
ans += edge[(x, y)]
del edge[(x, y)]
edge[x, i] = A[i]
edge[i, y] = A[i]
max_edge_list.append((x, i))
max_edge_list.append((i, y))
max_edge_list.remove((x, y))
print(ans) | N = int(eval(input()))
A = list(map(int, input().split()))
A.sort(reverse=True)
edge = {}
edge[0, 1] = min(A[0], A[1])
edge[1, 0] = min(A[0], A[1])
ans = A[0]
max_edge_list = [(0, 1), (1, 0)]
idx = 0
for i in range(2, N):
x, y = max_edge_list[idx]
ans += edge[(x, y)]
#del edge[(x, y)]
edge[x, i] = A[i]
edge[i, y] = A[i]
max_edge_list.append((x, i))
max_edge_list.append((i, y))
#max_edge_list.pop(0)
idx += 1
print(ans) | p02615 |
import heapq
N = int(eval(input()))
A = list(map(int, input().split()))
A.sort(reverse=True)
h = [-A[0]]
ans = 0
for i in range(1,N):
ans -= heapq.heappop(h)
heapq.heappush(h, -A[i])
heapq.heappush(h, -A[i])
print(ans)
| N = int(eval(input()))
A = list(map(int, input().split()))
A.sort(reverse=True)
AA = []
for i in range(N):
if i == 0:
AA.append(A[i])
else:
AA.append(A[i])
AA.append(A[i])
AA.sort(reverse=True)
ans = 0
for i in range(N-1):
ans += AA[i]
print(ans)
| p02615 |
n=int(eval(input()))
a=list(map(int,input().split()))
a.sort(reverse=True)
l=[a[0]]
ans=0
for aa in a[1:]:
ans+=max(l)
l.remove(max(l))
l.append(aa)
l.append(aa)
print(ans) | n=int(eval(input()))
a=list(map(int,input().split()))
a.sort(reverse=True)
ans=a[0]
w=n//2
for aa in a[1:w]:
ans+=aa*2
if n%2!=0:
ans+=a[w]
print(ans) | p02615 |
n,*a=list(map(int,open(0).read().split()))
a=a+a
a.sort()
print((sum(a[-n:-1]))) | n,*a=list(map(int,open(0).read().split()));print((sum(sorted(a*2)[-n:-1]))) | p02615 |
# -*- coding: utf-8 -*-
import sys
import math
from bisect import bisect_left
from bisect import bisect_right
from collections import defaultdict
from heapq import heappop, heappush
import itertools
import random
from collections import deque
from decimal import *
import queue
input = sys.stdin.readline
def inputInt(): return int(eval(input()))
def inputMap(): return list(map(int, input().split()))
def inputList(): return list(map(int, input().split()))
def inputStr(): return input()[:-1]
inf = float('inf')
mod = 1000000007
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
def main():
N = inputInt()
A = inputList()
A.sort()
A = A[::-1]
ans = 0
maxs = 0
cnt = 0
fst = True
ansans = []
pgt = queue.Queue()
for i,val in enumerate(A):
if i == 0:
pgt.put(val)
else:
tmp = pgt.get()
ansans.append(tmp)
pgt.put(val)
pgt.put(val)
print((sum(ansans)))
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
if __name__ == "__main__":
main()
| # -*- coding: utf-8 -*-
import sys
import math
from bisect import bisect_left
from bisect import bisect_right
from collections import defaultdict
from heapq import heappop, heappush
import itertools
import random
from collections import deque
from decimal import *
import queue
input = sys.stdin.readline
def inputInt(): return int(eval(input()))
def inputMap(): return list(map(int, input().split()))
def inputList(): return list(map(int, input().split()))
def inputStr(): return input()[:-1]
inf = float('inf')
mod = 1000000007
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
def main():
N = inputInt()
A = inputList()
A.sort()
A = A[::-1]
ansans = []
pgt = queue.Queue()
for i,val in enumerate(A):
if i == 0:
pgt.put(val)
else:
tmp = pgt.get()
ansans.append(tmp)
pgt.put(val)
pgt.put(val)
print((sum(ansans)))
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
if __name__ == "__main__":
main()
| p02615 |
def d_chat_in_a_circle():
N = int(eval(input()))
A = sorted([int(i) for i in input().split()], reverse=True)
ans = [A[0]]
j = 1
while True:
ans.extend([A[j]] * 2)
j += 1
if len(ans) > N - 1:
ans.pop()
break
if N % 2 == 0:
ans.pop()
return sum(ans)
print((d_chat_in_a_circle())) | def d_chat_in_a_circle():
N = int(eval(input()))
A = sorted([int(i) for i in input().split()])
return sum(A[(N - 1) - (k // 2)] for k in range(1, N))
print((d_chat_in_a_circle())) | p02615 |
ni = lambda: int(eval(input()))
nm = lambda: list(map(int, input().split()))
nl = lambda: list(map(int, input().split()))
n=ni()
a=sorted(nl())[::-1]
# val next
l=[(-1,-1)]*(n+1)
l[0]=(a[0],0)
nx_idx=1
ans = 0
for i in range(1,n):
aa = a[i]
now = 0
mx_idx=0
mx=-1
cnt=0
while True:
cnt+=1
val = l[now][0]
nxt = l[now][1]
nxtv=0
nxtv=l[nxt][0]
n_val = min(val,nxtv)
if mx < n_val:
mx = n_val
mx_idx = now
if nxt == a[i]:
break
if cnt==nx_idx:
break
now = nxt
ans+=mx
val = l[mx_idx][0]
nxt = l[mx_idx][1]
l[nx_idx]=(a[i],l[mx_idx][1])
l[mx_idx]=(mx,nx_idx)
nx_idx+=1
print(ans)
| ni = lambda: int(eval(input()))
nm = lambda: list(map(int, input().split()))
nl = lambda: list(map(int, input().split()))
n=ni()
a=sorted(nl())[::-1]
ans=0
cur=0
now=1
for i in range(n-1):
ans+=a[cur]
if now==1:
now=0
cur+=1
elif now==0:
now=1
print(ans)
| p02615 |
N = int(eval(input()))
As = sorted(list(map(int, input().split())), reverse = True)
points = []
for i in range(N):
points = points + [As[i]] * (i+1)
print((sum(points[:N-1]))) | N = int(eval(input()))
As = sorted(list(map(int, input().split())), reverse = True)
ans = As[0]
N -= 2
p = N // 2
ans += sum(As[1:1+p]) * 2
if N % 2 == 1:
ans += As[1+p]
print(ans) | p02615 |
N = int(eval(input()))
s = input().split()
A = []
for i in range(N):
A.append(int(s[i]))
result = 0
for i in range(N-1):
if i == 0 or i%2 == 1:
m = max(A)
result += m
A.remove(m)
else:
result += m
print(result) | N = int(eval(input()))
s = input().split()
A = []
for i in range(N):
A.append(int(s[i]))
result = 0
A.sort(reverse=True)
result += A[0]
A.pop(0)
if N % 2 == 0:
result += sum(A[:(int(N/2)-1)])*2
else:
result += (sum(A[:(int((N-1)/2)-1)])*2 + A[int((N-1)/2)-1])
print(result) | p02615 |
N = int(eval(input()))
h = list(map(int, input().split()))
current_h = [0] * N
c = 0
l = 0
while True:
escape_loop = False
while current_h[l] == h[l]:
if l + 1 < N:
l += 1
else:
escape_loop = True
break
if escape_loop:
break
r = l
while True:
if r + 1 < N and current_h[r + 1] < h[r + 1]:
r += 1
else:
break
for i in range(l, r + 1):
current_h[i] += 1
c += 1
print(c)
| N = int(eval(input()))
h = list(map(int, input().split()))
s = h[0]
for i in range(1, N):
s += max(0, h[i] - h[i - 1])
print(s)
| p03147 |
N = int(eval(input()))
L = list(map(int,input().split()))
ans = 0
def zero_spliter(L):
cnt = 1
for x in L:
if x == 0:
cnt += 1
M = [[] for _ in range(cnt)]
i = 0
for x in L:
if x != 0:
M[i].append(x)
else:
i += 1
for x in M:
if x != []:
yield x
ans = 0
def counter(L):
global ans
if L == []:
pass
if 0 in L:
l = list(zero_spliter(L))
for x in l:
counter(x)
else:
M = [x-1 for x in L]
ans += 1
counter(M)
counter(L)
print(ans)
| N = int(eval(input()))
L = list(map(int,input().split()))
def count(L):
if len(L) == 1:
return L[0]
if L == []:
return 0
if 0 in L:
i = L.index(0)
return count(L[:i]) + count(L[i+1:])
else:
m = min(L)
L = list([x-m for x in L])
return m + count(L)
print((count(L)))
| p03147 |
def main():
N = int(eval(input()))
h = list(map(int, input().split()))
ans = 0
while sum(h) > 0:
ans += 1
flag = False
for i in range(N):
if h[i] > 0:
h[i] -= 1
flag = True
elif flag is True:
break
print(ans)
if __name__ == '__main__':
main() | N, *h = list(map(int, open(0).read().split()))
ans = sum([max(h[i + 1] - h[i], 0) for i in range(N - 1)])
print((ans + h[0])) | p03147 |
from sys import stdin
def main():
#入力
readline=stdin.readline
N=int(readline())
h=list(map(int,readline().split()))
count=0
while 1:
first=True
for i in range(N):
if first and h[i]>=1:
first=False
h[i]-=1
elif first and h[i]==0:
pass
elif first is False and h[i]>=1:
h[i]-=1
elif first is False and h[i]==0:
break
if first:
break
else:
count+=1
print(count)
if __name__=="__main__":
main() | from sys import stdin
def main():
#入力
readline=stdin.readline
n=int(readline())
h=list(map(int,readline().split()))
ans=0
while True:
flag=True
flag2=True
for i in range(n):
if h[i]>0:
h[i]-=1
flag=False
flag2=False
if i==n-1:
ans+=1
else:
if flag2==False:
flag2=True
ans+=1
if flag: break
print(ans)
if __name__=="__main__":
main() | p03147 |
# import sys
# input = sys.stdin.readline
# import re
import collections
import bisect
import math
import fractions
import collections
import itertools
from functools import reduce
def main():
n = int(eval(input()))
h = list(input_list())
count = 0
while True:
if list(set(h)) == [0]:
break
flag = False
count += 1
for i, v in enumerate(h):
if v != 0:
flag = True
h[i] -= 1
else:
if flag:
break
print(count)
def minus(numbers):
for i, n in enumerate(numbers):
if n == 0:
break
numbers[i] -= 1
return numbers
def input_list():
return list(map(int, input().split()))
def input_list_str():
return list(map(str, input().split()))
if __name__ == '__main__':
main()
| # import sys
# input = sys.stdin.readline
import collections
def main():
n = int(eval(input()))
h = input_list()
count = 0
while True:
if list(set(h)) == [0]:
break
count += 1
f = False
for i, v in enumerate(h):
if v == 0:
if f:
break
if v > 0:
h[i] -= 1
f = True
print(count)
def input_list():
return list(map(int, input().split()))
def input_list_str():
return list(map(str, input().split()))
if __name__ == "__main__":
main()
| p03147 |
n=int(eval(input()))
h=[0]+list(map(int,input().split()))+[0]
cnt=0
while any([i!=0 for i in h]):
start,end=100,100
for i in range(n+2):
if h[i]!=0:
start=min(start,i)
elif h[i]==0 and start<i:
end=min(end,i)
l=[i-1 for i in h[start:end]]
h=h[:start]+l+h[end:]
cnt+=1
print(cnt) | n=int(eval(input()))
h=[0]+list(map(int,input().split()))+[0]
cnt=0
while any([i!=0 for i in h]):
start,end=100,100
for i in range(n+2):
if h[i]!=0:
start=min(start,i)
elif h[i]==0 and start<i:
# end=min(end,i)
end=i
break
l=[i-1 for i in h[start:end]]
h=h[:start]+l+h[end:]
cnt+=1
print(cnt) | p03147 |
n = int(eval(input()))
li = list(map(int,input().split()))
all_li = [li]
def conv(target_list):
count = 0
flag = True
while flag:
all_tmp = []
for each_list in target_list:
tmp = []
m = min(each_list)
count += min(each_list)
#print(each_list)
for e in each_list:
if e-m != 0:
tmp.append(e-m)
else:
if tmp:
all_tmp.append(tmp)
tmp = []
if tmp:
all_tmp.append(tmp)
if len(all_tmp) == 0:
flag = False
target_list = all_tmp
return count
print((conv(all_li))) | n = int(eval(input()))
li = list(map(int,input().split()))
last = li[0]
count = li[0]
for i,l in enumerate(li):
if i == 0:
continue
if l > last:
count += l - last
last = l
print(count) | p03147 |
N = int(eval(input()))
H = list(map(int,input().split()))
H = [0]+H+[0]
def trm(li):
for i in range(len(li)-2,0,-1):
if li[i-1]<=li[i]<=li[i+1]:
li.pop(i)
elif li[i-1]>=li[i]>=li[i+1]:
li.pop(i)
return H
H = trm(H)
cnt = 0
for i in range(max(H),0,-1):
flg = False
for j in range(len(H)):
if H[j]==i:
if not flg:
cnt +=1
flg = True
H[j]=H[j]-1
else:
flg = False
print(cnt) | #!/usr/bin python3
# -*- coding: utf-8 -*-
def cnt(A, x):
N = len(A)
i = 0
ret = 0
while i<N:
if A[i]<x:
i += 1
else:
ret += 1
while i<N and A[i]>=x:
i += 1
return ret
def main():
N = int(eval(input()))
A = list(map(int, input().split()))
ret = 0
for i in range(1,101):
ret += cnt(A,i)
print(ret)
if __name__ == '__main__':
main() | p03147 |
N = int(eval(input()))
h = list(map(int,input().split()))
h = [0] + h
ans = 0
while(sum(h)>0):
for i in range(N):
if h[i] == 0 and h[i+1] > 0:
ans += 1
for i in range(N+1):
if h[i] > 0:
h[i] -= 1
print(ans) | N = int(eval(input()))
h = list(map(int,input().split()))
h = [0] + h
ans = 0
for i in range(N):
if h[i]<h[i+1]:
ans += h[i+1]-h[i]
print(ans)
| p03147 |
def main():
n, *h = list(map(int, open(0).read().split()))
ans = 0
f = True
base = 0
for i, j in zip(h, h[1:]):
g = i <= j
if f and not g:
ans += i - base
if not f and g:
base = i
f = g
else:
if f:
ans += h[-1] - base
print(ans)
if __name__ == '__main__':
main()
| def main():
n, *h = list(map(int, open(0).read().split()))
ans = 0
for i, j in zip([0] + h, h):
if i < j:
ans += (j - i)
print(ans)
if __name__ == '__main__':
main()
| p03147 |
def main():
n = int(eval(input()))
h_li = list(map(int, input().split()))
i = 0
count = 0
f = 0
discount = max(h_li)
while True:
if h_li[i] >= discount:
count += 1
h_li[i] -= 1
while i < len(h_li) - 1:
if h_li[i + 1] >= discount:
i += 1
h_li[i] -= 1
else:
i += 1
break
if i == len(h_li) - 1:
i = 0
discount -= 1
if max(h_li) == 0:
f = 1
else:
i += 1
if f == 1:
break
print(count)
if __name__ == '__main__':
main() | n = int(eval(input()))
h_li = list(map(int, input().split()))
count = 0
for i in range(100):
f = 0
for j in range(n):
if h_li[j] >= i + 1:
if f == 0:
count += 1
f = 1
else:
f = 0
print(count)
| p03147 |
N = int(eval(input()))
h = list(map(int,input().split()))
count = 0
i = 0
while sum(h) > 0:
if h[i] > 0:
j = i
count += 1
while j < N and h[j] > 0:
h[j] = h[j] - 1
j += 1
else:
i += 1
print(count) | N = int(eval(input()))
h = list(map(int, input().split()))
cnt = 0
i = 0
for _ in range(100 * 100):
if h[i] > 0:
j = i
cnt += 1
while j < N and h[j] > 0:
h[j] = h[j] - 1
j += 1
else:
i += 1
if i == N:
break
print(cnt) | p03147 |
n = int(eval(input()))
h = list(map(int, input().split()))
c = 0
while any(h):
ans = 0
for l in range(n):
tmp = 0
r = l
while h[r]:
tmp += 1
r += 1
if r == n:
break
if ans < tmp:
x = l
y = r
ans = tmp
for i in range(x, y):
h[i] -= 1
c += 1
print(c)
| n = int(eval(input()))
h = list(map(int, input().split()))
ans = h[0]
for i in range(n-1):
ans += max(h[i+1]-h[i], 0)
print(ans)
| p03147 |
n = int(eval(input()))
h = list(map(int,input().split()))
ans = h[0]
for i in range(1,n):
if h[i-1]<h[i]: ans += h[i]-h[i-1]
print(ans) | n = int(eval(input()))
h = list(map(int,input().split()))
ans = h[0]
for i in range(1,n):
if h[i]>h[i-1]:ans+=h[i]-h[i-1]
print(ans) | p03147 |
n = int(eval(input()))
l = list(map(int, input().split()))
l = [0] + l + [0]
ans = 0
for i in range(1, max(l)+1):
g = 0
for j in range(1, n+1):
if l[j] >= i and l[j-1] < i:
g += 1
ans += g
print(ans) | n = int(eval(input()))
H = list(map(int, input().split()))
H = [-1]+H+[-1]
ans = 0
for i in range(1, 101):
for j in range(1, n+1):
if H[j] >= i and H[j-1] < i:
ans += 1
print(ans)
| p03147 |
n = int(eval(input()))
h = list(map(int, input().split()))
ans = 0
while sum(h) != 0:
flag = False
for i in range(n):
if h[i] != 0: flag = True
if flag == True and h[i] == 0: break
elif flag == False and h[i] == 0: continue
h[i] -= 1
ans += 1
print(ans) | n = int(eval(input()))
h = list(map(int, input().split()))
ans = 0
while max(h) != 0:
if h[0] > 0: flag = True
else: flag = False
if flag:
for i in range(n):
if h[i] == 0: break
h[i] -= 1
ans += 1
else:
for i in range(1,n):
if flag == False and h[i] == 0: continue
if flag == True and h[i] == 0: break
flag = True
h[i] -= 1
ans += 1
print(ans) | p03147 |
N = int(eval(input()))
H = list(map(int, input().split()))
ans = 0
for i in range(N-1):
while True:
if H[i] <= 0:
break
base = H[i]
for j in range(i+1, N):
# 花の高さが0なら初期のまま
if H[j] <= 0:
break
# 次の花(j+1)が基準の花(j)以下か
if base <= H[j]:
H[j] -= 1
else:
break
H[i] -= 1
ans += 1
ans += max(0, H[-1])
print(ans)
| N = int(eval(input()))
H = list(map(int, input().split()))
ans = 0
for i in range(N-1):
while True:
if H[i] == 0:
break
for j in range(i+1, N):
if H[j] == 0:
break
H[j] -= 1
H[i] -= 1
ans += 1
ans += max(0, H[-1])
print(ans)
| p03147 |
import sys
def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def I(): return int(sys.stdin.buffer.readline())
def LS(): return sys.stdin.buffer.readline().rstrip().decode('utf-8').split()
def S(): return sys.stdin.buffer.readline().rstrip().decode('utf-8')
def IR(n): return [I() for i in range(n)]
def LIR(n): return [LI() for i in range(n)]
def SR(n): return [S() for i in range(n)]
def LSR(n): return [LS() for i in range(n)]
def SRL(n): return [list(S()) for i in range(n)]
def MSRL(n): return [[int(j) for j in list(S())] for i in range(n)]
mod = 10 ** 9 + 7
n = I()
hl = LI()
wl = []
count = 0
len_h = len(hl)
def m1(n):
if n > 0:
n = n - 1
else:
n = 0
return n
max_hana = max(hl)
if max_hana == 0:
print((0))
sys.exit()
for i in range(max_hana):
for j in range(len_h):
if j == 0:
if hl[j] > 0:
count += 1
else:
if hl[j] > 0 and hl[j-1] == 0:
count += 1
elif hl[j] > 0 and hl[j-1] == 0:
count += 1
hl = list(map(m1, hl))
print(count) | import sys
def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def I(): return int(sys.stdin.buffer.readline())
def LS(): return sys.stdin.buffer.readline().rstrip().decode('utf-8').split()
def S(): return sys.stdin.buffer.readline().rstrip().decode('utf-8')
def IR(n): return [I() for i in range(n)]
def LIR(n): return [LI() for i in range(n)]
def SR(n): return [S() for i in range(n)]
def LSR(n): return [LS() for i in range(n)]
def SRL(n): return [list(S()) for i in range(n)]
def MSRL(n): return [[int(j) for j in list(S())] for i in range(n)]
mod = 10 ** 9 + 7
n = I()
hl = LI()
# count = 0
# len_h = len(hl)
# def m1(n):
# if n > 0:
# n = n - 1
# else:
# n = 0
# return n
# max_hana = max(hl)
# if max_hana == 0:
# print(0)
# sys.exit()
# for i in range(max_hana):
# for j in range(len_h):
# if j == 0:
# if hl[j] > 0:
# count += 1
# else:
# if hl[j] > 0 and hl[j-1] == 0:
# count += 1
# elif hl[j] > 0 and hl[j-1] == 0:
# count += 1
# hl = list(map(m1, hl))
# print(count)
######################
# 隣との差分を考えたほうが早い
# 1 2 4 2 1 0 計4
# 1 2 0 0 0
ans = hl[0]
for i in range(1, n):
ans += max(0, hl[i] - hl[i - 1])
print(ans)
| p03147 |
n = int(eval(input()))
h = list(map(int,input().split()))
ans = 0
for i in range(max(h)):
c = 0
for j in range(n):
if h[j] != 0:
h[j] -= 1
c += 1
else:
if c != 0:
ans += 1
c = 0
if j == n-1 and c != 0:
ans += 1
print(ans) | n = int(eval(input()))
h = list(map(int,input().split()))
ans = 0
c = 0
while max(h) != 0:
flag = False
for i in range(n):
if h[i] != 0:
h[i] -= 1
flag = True
if i == n-1:
ans += 1
c += 1
elif flag:
flag = False
ans += 1
print(ans) | p03147 |
n=int(eval(input()))
h=list(map(int,input().split()))
print((sum([max(0,h[i+1]-h[i]) for i in range(n-1)])+h[0])) | n=int(eval(input()))
h=list(map(int,input().split()))
print((sum(max(0,h[i+1]-h[i])for i in range(n-1))+h[0])) | p03147 |
n = int(eval(input()))
h = list(map(int, input().split()))
ans = 0
while True:
minh = 100
sub = 0
for i in range(n):
if h[i] != 0:
break
for fin in range(i, n):
if h[fin] == 0:
fin -= 1
break
for j in range(i,fin + 1):
if minh > h[j]:
minh = h[j]
sub = j
minus = h[sub]
for k in range(i, fin + 1):
h[k] -= minus
ans += minus
if h.count(0) == n:
break
print(ans) | n = int(eval(input()))
h = list(map(int, input().split()))
ans = h[0]
for i in range(n - 1):
ans += max(0, h[i + 1] - h[i])
print(ans) | p03147 |
n = int(eval(input()))
h = list(map(int,input().split()))
count = 0
done = False
while done == False:
for i in range(n):
if h[i] >= 0:
h[i] -= 1
if i > 0 and h[i] < 0 and h[i-1] >= 0:
count += 1
if i == n-1 and h[i] >= 0:
count += 1
if max(h) == 0:
done = True
print(count)
| n = int(eval(input()))
h = list(map(int,input().split()))
count = 0
done = False
while done == False:
for i in range(n):
if h[i] >= 0:
h[i] -= 1
if i > 0 and h[i] < 0 and h[i-1] >= 0:
count += 1
if i == n-1 and h[i] >= 0:
count += 1
if max(h) <= 0:
done = True
print(count)
| p03147 |
N = int(eval(input()))
lst = list(map(int, input().split()))
count = 0 #水をやる回数
def water(i, j): #lst[i:j]に水をやるとする
count = 0
#print ('A')
#print ('lst', lst[i:j])
#print ('i, j=', i, j)
if i == j or lst[i:j] == [0]:
#print ('X')
return 0
elif min(lst[i:j]) == 0: #lst[i:j]内の最小値が0の時
a = lst[i:j].index(0)
#print ('a=', a)
#print ('B', count)
count = water(i,i + a) + water(i + a+1, j)
return count
else: #lst[i:j]の最小値が0でない時
for x in range(i,j):
lst[x] = lst[x] - 1
#print ('C', count)
count += 1 + water(i, j)
return count
print((water(0, N)))
| import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 9)
MOD = 10 ** 9 + 7
N = int(eval(input()))
H = list(map(int, input().split()))
if N == 1:
print((H[0]))
exit()
ans = 00
i = 1
for i in range(N - 1):
if H[i] < H[i + 1]:
continue
else:
ans += H[i] - H[i + 1]
ans += H[N - 1]
print (ans) | p03147 |
n = int(eval(input()))
H = list(map(int,input().split()))+[0]
res = 0
for i in range(n):
if H[i] > H[i+1]:
res += H[i]-H[i+1]
print(res)
| n = int(eval(input()))
h = [0]+list(map(int,input().split()))+[0]
res = 0
for i in range(1,n+2):
if h[i-1] < h[i]:
res += h[i]-h[i-1]
print(res) | p03147 |
count = 0
def rec(l, r):
global count
global h
if l >= r:
return
zero = list()
for i in range(l, r):
if h[i] == 0:
zero.append(i)
if len(zero) > 0:
for i in zero:
rec(l, i)
rec(i+1, r)
else:
for i in range(l, r):
h[i] -= 1
count += 1
rec(l, r)
n = int(eval(input()))
h = list(map(int, input().split()))
rec(0, len(h))
print(count)
| count = 0
def rec(l, r):
global count
global h
global s
if l >= r:
return
zero = list()
for i in range(l, r):
if h[i] == 0:
zero.append(i)
if len(zero) > 0:
for i in zero:
if not (l, i) in s:
rec(l, i)
s.add((l, i))
if not (i+1, r) in s:
rec(i+1, r)
s.add((i+1, r))
else:
for i in range(l, r):
h[i] -= 1
count += 1
rec(l, r)
n = int(eval(input()))
h = list(map(int, input().split()))
s = set()
rec(0, len(h))
print(count)
| p03147 |
N = int(eval(input()))
h = list(map(int, input().split()))
ans = 0
def water(x):
global ans
# print(x, ans)
if any(x) == False:
# print(0)
return
else:
# print(1)
if 0 in x:
# print(2)
x1, x2 = x[0:x.index(0)], x[x.index(0)+1:]
water(x1)
water(x2)
else:
# print(3)
ans += min(x)
x = list([i-min(x) for i in x])
water(x)
return
water(h)
print(ans)
| N = int(eval(input()))
h = [int(i) for i in input().split()]
h.append(0)
ans = 0
while any(h):
l,r = 0, 0
for i in range(N):
if h[i] == 0 and h[i+1] != 0:
l = i+1
if (h[i] != 0 and h[i+1] == 0):
r = i+1
minh = min(h[l:r])
ans += minh
for j in range(l,r):
h[j] -= minh
print(ans) | p03147 |
n = int(eval(input()))
H = list(map(int, input().split()))
T = [0 for _ in range(n)]
c = 0
while True:
f = False
S = {0:1}
for j in range(n):
if H[j] > 0:
S[1] = 1
H[j] -= 1
f = True
elif len(S) > 1 and H[j] == 0:
break
if f: c += 1
if H == T: break
print(c)
| n = int(eval(input()))
H = [0] + list(map(int, input().split())) + [0]
T = [0 for _ in range(n+2)]
c = 0
while True:
s0 = 0; t1 = 0
for i in range(0, n+2):
if H[i] > 0 and s0 == 1:
H[i] -= 1
t1 = 1
elif H[i] == 0 and t1 == 1:
c += 1
t1 = 0
elif H[i] == 0:
s0 = 1
if H == T: break
print(c) | p03147 |
def main():
N = int(eval(input()))
h = [int(i) for i in input().split()]
ans = 0
mul = h[1:N-1].count(0) + 1
for i in range(max(h)):
ans += 1 * mul
z_cnt = 0
flag = False
for j in range(N):
h[j] = (h[j]-1 if h[j] != 0 else h[j])
if h[j] != 0:
flag = True
elif j == N-1 and h[j] == 0 and not flag:
z_cnt -= 1
elif j != 0 and j != N-1 and h[j] == 0 and flag:
z_cnt += 1
flag = False
mul = z_cnt + 1
print(ans)
if __name__ == "__main__":
main() | def main():
N = int(eval(input()))
h = [0] + [int(i) for i in input().split()]
ans = 0
for i in range(N):
ans += max(0, h[i+1] - h[i])
print(ans)
if __name__ == '__main__':
main()
| p03147 |
def main():
N = int(eval(input()))
h = [0] + [int(i) for i in input().split()]
ans = 0
for i in range(N):
ans += max(0, h[i+1] - h[i])
print(ans)
if __name__ == '__main__':
main()
| def main():
_ = int(eval(input()))
H = [int(i) for i in input().split()]
cur_h = 0
ans = 0
for h in H:
if cur_h < h:
ans += h - cur_h
cur_h = h
print(ans)
if __name__ == '__main__':
main()
| p03147 |
N = int(eval(input()))
h = list(map(int, input().split()))
h.append(0)
min_n = 100
ans = 0
cnt = 0
i = 0
while i < N + 1:
if h[i] != 0:
cnt += 1
min_n = min(min_n, h[i])
elif h[i] == 0 and cnt != 0:
ans += min_n
for j in range(i+1):
h[j] = max(h[j]-min_n, 0)
min_n = 100
cnt = 0
i = -1
i += 1
print(ans)
| N = int(eval(input()))
h = list(map(int, input().split())) + [0]
ans = 0
# 最大h×N本の全探索
# 連続が途切れる数を下からカウントすれば答えとなる
for i in range(max(h)):
for j in range(N):
if h[j] - i > 0 and h[j + 1] - i <= 0:
ans += 1
print(ans) | p03147 |
from functools import reduce
N = int(eval(input()))
h = [int(s) for s in input().split()]
prev = 0
count = 0
for i in range(N):
count += h[i] - prev if h[i] > prev else 0
prev = h[i]
print(count)
| def grand_garden(N: int, H: list) -> int:
before = 0
op = 0
for h in H:
if before < h:
op += h - before
before = h
return op
if __name__ == "__main__":
N = int(eval(input()))
H = [int(s) for s in input().split()]
ans = grand_garden(N, H)
print(ans)
| p03147 |
ri = lambda: int(eval(input()))
rl = lambda: list(map(int,input().split()))
N = ri()
h = rl()
hl = len(h)
ans = 0
flag = 0
for _ in range(sum(h)):
if sum(h) == 0:
break
flag = 1
for i in range(hl):
if flag == 1 and h[i] != 0:
flag = 0
h[i] = h[i] - 1
ans += 1
elif flag == 0 and h[i] == 0:
flag = 1
elif flag == 0 and h[i] != 0:
h[i] = h[i] - 1
print(ans)
| ri = lambda: int(eval(input()))
rl = lambda: list(map(int,input().split()))
N = ri()
h = rl()
ans = 0
pre = 0
for i in h:
if pre < i:
ans += i - pre
pre = i
print(ans) | p03147 |
N = int(eval(input()))
h = list(map(int, input().split()))
if sum(h) == 0:
print((0))
exit()
ans = 0
flag = False
while True:
if h[0] == 0:
flag = True
for i in range(N):
if h[i] == 0 and flag == True:
continue
elif h[i] == 0 and flag == False:
break
h[i] -= 1
flag = False
ans += 1
if sum(h) == 0:
break
print(ans) | N = int(eval(input()))
array = list(map(int,input().split()))
ans = 0
while True:
if max(array) == 0:
break
flg = False
for i in range(N):
if array[i] == 0:
if flg:
break
continue
array[i] -= 1
flg = True
ans += 1
print(ans) | p03147 |
# -*- coding: utf-8 -*-
n = int(eval(input()))
h_list = list(map(int, input().split()))
if not len(h_list) == n :
raise RuntimeError("Mismatch Length.")
count = 0
while True:
h_max = max(h_list)
if h_max == 0:
break
isMax_list = [h == h_max for h in h_list]
for i, isMax in enumerate(isMax_list):
if isMax:
h_list[i] -= 1
if i == 0 or not isMax_list[i-1]:
count += 1
print(count)
| N = int(eval(input()))
H = [0] + list(map(int, input().split()))
ans = 0
for i in range(N):
ans += max(H[i + 1] - H[i], 0)
print(ans)
| p03147 |
N = int(eval(input()))
H = list(map(int, input().split()))
M = max(H)
ans = 0
for m in range(1, M + 1):
i = 0
while i < N:
if H[i] >= m:
ans += 1
while H[i] >= m:
i += 1
if i >= N:
break
else:
i += 1
print(ans)
| import sys
sys.setrecursionlimit(10 ** 6)
INF = float("inf")
MOD = 10 ** 9 + 7
def input():
return sys.stdin.readline().strip()
def check(H):
N = len(H)
for i in range(N):
if H[i] != 0:
return False
return True
def main():
N = int(eval(input()))
H = list(map(int, input().split()))
ans = 0
while True:
if check(H):
break
# 区間分割
i = 0
while i < N:
if H[i] == 0:
i += 1
else:
# 区間が始まる
ans += 1
while i < N and H[i] > 0:
H[i] -= 1
i += 1
print(ans)
if __name__ == "__main__":
main()
| p03147 |
n = int(eval(input()))
h = list(map(int, input().split()))
result = 0
while True:
start = n
for i in range(n):
if h[i] != 0:
start = i
break
if start == n:
break
end = n - 1
for i in range(start, n):
if h[i] == 0:
end = i - 1
break
h[i] -= 1
result += 1
print(result)
| n = int(eval(input()))
h = list(map(int, input().split()))
result = 0
while True:
start = n
for i in range(n):
if h[i] != 0:
start = i
break
if start == n:
break
end = n - 1
count = 101
for i in range(start, n):
if h[i] == 0:
end = i - 1
break
if h[i] < count:
count = h[i]
for i in range(start, end + 1):
h[i] -= count
result += count
print(result)
| p03147 |
def main():
N = int(eval(input()))
h = list(map(int, input().split()))
c = h[0]
for i in range(N - 1):
if h[i + 1] > h[i]:
c += h[i + 1] - h[i]
print(c)
main()
| N = int(eval(input()))
H = list(map(int, input().split()))
ans = H[0]
for i in range(N - 1):
if H[i + 1] > H[i]:
ans += H[i + 1] - H[i]
print(ans)
| p03147 |
def inpl(): return [int(i) for i in input().split()]
N = int(eval(input()))
H = inpl()
ans = 0
while True:
ctr = 1
for i in range(N):
if H[i]:
ans += ctr
ctr = 0
H[i] -= 1
else:
ctr = 1
if not any(H):
break
print(ans) | def inpl(): return [int(i) for i in input().split()]
N = int(eval(input()))
H = [0] + inpl()
print((sum([max(0, H[i+1] - H[i]) for i in range(N)])))
| p03147 |
import copy
n = int(eval(input()))
h = list(map(int, input().split()))
ans = 0
tmp = 0
for i in range(n):
ans += h[i]
tmp = copy.deepcopy(h)
tmp_ = tmp[i]
for j in range(i, n):
if h[j] - tmp_ >= 0:
h[j] -= tmp_
else:
tmp_ = tmp[j]
h[j] = 0
print(ans)
| n = int(eval(input()))
h = list(map(int, input().split()))
ans = 0
tmp = 0
for i in range(n):
ans += h[i]
tmp = int(h[i])
for j in range(i, n):
if h[j] - tmp >= 0:
h[j] -= tmp
else:
tmp = int(h[j])
h[j] = 0
print(ans) | p03147 |
n = int(eval(input()))
h = list(map(int, input().split()))
ans = 0
hk = 0
for i in range(n):
if hk == h[i]:
continue
elif hk < h[i]:
while hk < h[i]:
hk += 1
ans += 1
elif hk > h[i]:
while hk > h[i]:
hk -= 1
print(ans) | n = int(eval(input()))
h = list(map(int, input().split()))
ans = hk = 0
for i in range(n):
if hk < h[i]:
ans += h[i] - hk
hk = h[i]
print(ans) | p03147 |
from collections import deque
N = int(eval(input()))
h = list(map(int,input().split()))
stack = deque([])
prevPoint = -1
for i in range(N) :
if h[i] == 0 :
stack.append((prevPoint+1 , i))
prevPoint = i
elif i >= N - 1 :
stack.append((prevPoint+1,N))
ans = 0
while stack :
start , end = stack.pop()
if start >= end :
ans += h[start]
h[start] = 0
continue
minus = min(h[start:end])
ans += minus
prevPoint = start - 1
for i in range(start,end) :
h[i] -= minus
if h[i] == 0 :
stack.append((prevPoint+1,i))
prevPoint = i
elif i >= end - 1 :
stack.append((prevPoint+1,end))
print(ans)
| N = int(eval(input()))
H = list(map(int, input().split()))
ans = 0
while max(H) > 0:
grp = [[]]
for i, h in enumerate(H):
if h == 0:
if len(grp[-1]) > 0:
grp.append([])
else:
grp[-1].append((i, h))
for g in grp:
if len(g) == 0:
continue
mi = min([h for _, h in g])
ans += mi
for i, _ in g:
H[i] -= mi
print(ans)
| p03147 |
n = int(eval(input()))
lst = list(map(int, input().split()))
res = 0
pre_left = 0
while True:
Max = 0
w = 0
left = 0
right = n
flag = False
for i in range(n):
if lst[i] > 0 and not flag:
if i == n-1:
if Max:
break
w = 1
pre_left = left
left = i
flag = True
if i == n-1:
right = n
Max = 1
elif lst[i] > 0 and flag:
w += 1
if i == n-1:
if Max < w:
Max = w
right = n
else:
left = pre_left
elif lst[i] <= 0 and flag:
if Max < w:
Max = w
right = i
flag = False
else:
left = pre_left
w = 0
if w == n:
Max = n
if Max == 0:
break
d = min(lst[left:right])
for i in range(left, right):
lst[i] -= d
res += d
print(res) | def rec(lst, left, right):
if left == right:
return 0
if not 0 in lst[left:right]:
m = min(lst[left:right])
lst[left:right] = [x - m for x in lst[left:right]]
return m + rec(lst, left, right)
k = lst[left:right].index(0)
return rec(lst, left, left + k) + rec(lst, left + k+1, right)
N = int(eval(input()))
lst = list(map(int, input().split()))
print((rec(lst, 0, len(lst)))) | p03147 |
def dfs(L):
if len(L) == 0:
return 0
ret = min(L)
L = [e - ret for e in L]
L2 = []
for i, e in enumerate(L):
if e == 0:
ret += dfs(L2)
L2 = []
else:
L2.append(e)
ret += dfs(L2)
return ret
def main():
n = int(eval(input()))
H = [int(e) for e in input().split()]
print((dfs(H)))
if __name__ == "__main__":
main()
| def dfs(L):
if len(L) == 0:
return 0
ret = min(L)
L = [e - ret for e in L]
L2 = []
for e in L:
if e == 0:
ret += dfs(L2)
L2 = []
else:
L2.append(e)
ret += dfs(L2)
return ret
def main():
n = int(eval(input()))
H = [int(e) for e in input().split()]
print((dfs(H)))
if __name__ == "__main__":
main()
| p03147 |
n = int(eval(input()))
h = list(map(int, input().split()))
res = 0
i = 0
while sum(h) != 0:
if h[i] != 0:
while i < n and h[i] != 0:
h[i] -= 1
i += 1
res += 1
i = 0
else:
i += 1
print(res)
| import sys
sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
f_inf = float('inf')
mod = 10 ** 9 + 7
def resolve():
n = int(eval(input()))
H = list(map(int, input().split()))
res = 0
i = 0
while sum(H) != 0:
if H[i] != 0:
while i < n and H[i] != 0:
H[i] -= 1
i += 1
res += 1
i = 0
else:
i += 1
print(res)
if __name__ == '__main__':
resolve()
| p03147 |
n = int(eval(input()))
H = list(map(int,input().split()))
seq = []
K = []
ans = 0
for i in H:
if i != 0:
K.append(i)
else:
if K:
seq.append(K)
K = []
else:
if K:
seq.append(K)
while seq:
L = seq.pop()
ans += min(L)
S = [n-min(L) for n in L]
K = []
for i in S:
if i!= 0:
K.append(i)
else:
if K:
seq.append(K)
K = []
else:
if K:
seq.append(K)
else:
print(ans)
| n = int(eval(input()))
seq =[list(map(int,input().split()))]
ans = 0
while seq:
L = seq.pop()
ans += min(L)
S = [n-min(L) for n in L]
K = []
for i in S:
if i!= 0:
K.append(i)
else:
if K:
seq.append(K)
K = []
else:
if K:
seq.append(K)
else:
print(ans)
| p03147 |
N = int(eval(input()))
H = list(map(int, input().split()))
# Hを1段ずつ減らしていく.
# 値が正の区間 (left, right) が一つ見つかるごとに答えは1増える.
ans = 0
while sum(H) > 0:
left = right = 0
prev = 0
segment = []
for i, h in enumerate(H):
if h == 0 and prev != 0: # H = {..., 0, *(left), *, ..., *, 0(right), ...} (*: 正数)
right = i
segment.append((left, right))
elif h != 0 and prev == 0:
left = i
if i == N-1: # H = {..., 0, *(left)} (*: 正数)
right = i + 1
segment.append((left, right))
elif h != 0 and i == N-1: #(prev != 0) H = {..., 0, *(left), ..., *, *} (*: 正数)
right = i + 1
segment.append((left, right))
prev = h
ans += len(segment)
# Hの値が正のところを1段減らす.
for l, r in segment:
for i in range(l, r):
H[i] -= 1
print(ans) | N = int(eval(input()))
H = list(map(int, input().split()))
stack = [H]
count = 0
while stack:
lst = stack.pop()
m = min(lst)
count += m
lst = [l-m for l in lst]
prev = 0
left = 0
for i, h in enumerate(lst):
if h == 0 and prev != 0: # H = {..., 0, *(left), *, ..., *, 0(right), ...} (*: 正数)
stack.append(lst[left:i])
elif h != 0 and prev == 0:
left = i
if i == len(lst)-1: # H = {..., 0, *(left)} (*: 正数)
stack.append(lst[left:i+1])
elif h != 0 and i == len(lst)-1: #(prev != 0) H = {..., 0, *(left), ..., *, *} (*: 正数)
stack.append(lst[left:i+1])
prev = h
print(count) | p03147 |
N=int(eval(input()))
L=[int(i) for i in input().split()]
L.append(0)
ans=0
for i in range(N):
ans+=max(0,L[i]-L[i+1])
print(ans) | N=int(eval(input()))
L=[int(i) for i in input().split()]
#L.append(0)
L.insert(0,0)
ans=0
for i in range(N):
ans+=max(0,L[i+1]-L[i])
print(ans)
| p03147 |
n=int(eval(input()))
h=list(map(int,input().split()))
ans=0
while any(h)==True:
flag=0
for i in range(n-1):
if h[i]>0:
h[i]-=1
flag=1
else:
if flag==1:
ans+=1
flag=0
if i==n-2:
if h[n-1]>0:
h[n-1]-=1
ans+=1
else:
if flag==1:
ans+=1
print(ans)
| n=int(eval(input()))
h=list(map(int,input().split()))
ans=0
if n==1:
print((h[0]))
exit()
while any(h)==True:
flag=0
for i in range(n-1):
if h[i]>0:
h[i]-=1
flag=1
else:
if flag==1:
ans+=1
flag=0
if i==n-2:
if h[n-1]>0:
h[n-1]-=1
ans+=1
else:
if flag==1:
ans+=1
print(ans)
| p03147 |
N = int(eval(input()))
array = input().split(' ')
harray = []
for z in array:
z = int(z)
harray.append(z)
counter = 0
while harray != [0]*N:
if 0 not in harray:
a = min(harray)
for i in range(len(harray)):
harray[i] -= a
counter += a
else:
zeroarray = [j for j, x in enumerate(harray) if x == 0]
if len(zeroarray) == 1:
if zeroarray[0] == 0:
a = min(harray[1:])
if len(harray) == 2:
harray[1] -= a
else:
for y in range(1,N):
harray[y] -= a
counter += a
elif zeroarray[0] == N-1:
a = min(harray[:N-1])
for y in range(N-1):
harray[y] -= a
counter += a
else:
a = min(harray[:zeroarray[0]])
for y in range(zeroarray[0]):
harray[y] -= a
counter += a
a = min(harray[zeroarray[0]+1:])
if zeroarray[0]+1 != N:
for y in range(zeroarray[0]+1,N):
harray[y] -= a
else:
harray[N-1] -= a
counter += a
else:
for k in range(len(zeroarray)-1):
if zeroarray[0] != 0:
a = min(harray[:zeroarray[0]])
for y in range(zeroarray[0]):
harray[y] -= a
counter += a
if zeroarray[k+1] - zeroarray[k] == 1:
continue
else:
a = min(harray[zeroarray[k]+1:zeroarray[k+1]])
for y in range(zeroarray[k]+1,zeroarray[k+1]):
harray[y] -= a
counter += a
if zeroarray[-1] != N-1:
a = min(harray[zeroarray[-1]+1:])
if zeroarray[-1]+1 != N:
for y in range(zeroarray[-1]+1,N):
harray[y] -= a
else:
harray[N-1] -= a
counter += a
print(counter) | N = int(eval(input()))
array = input().split(' ')
harray = []
for z in array:
z = int(z)
harray.append(z)
counter = 0
while harray != [0]*N:
if 0 not in harray:
a = min(harray)
for i in range(len(harray)):
harray[i] -= a
counter += a
else:
zeroarray = [j for j, x in enumerate(harray) if x == 0]
if len(zeroarray) == 1:
if zeroarray[0] == 0:
a = min(harray[1:])
if len(harray) == 2:
harray[1] -= a
else:
for y in range(1,N):
harray[y] -= a
counter += a
elif zeroarray[0] == N-1:
a = min(harray[:N-1])
for y in range(N-1):
harray[y] -= a
counter += a
else:
a = min(harray[:zeroarray[0]])
for y in range(zeroarray[0]):
harray[y] -= a
counter += a
a = min(harray[zeroarray[0]+1:])
if zeroarray[0]+1 != N:
for y in range(zeroarray[0]+1,N):
harray[y] -= a
else:
harray[N-1] -= a
counter += a
else:
if zeroarray[0] != 0:
a = min(harray[:zeroarray[0]])
for y in range(zeroarray[0]):
harray[y] -= a
counter += a
if zeroarray[-1] != N-1:
a = min(harray[zeroarray[-1]+1:])
if zeroarray[-1]+1 != N:
for y in range(zeroarray[-1]+1,N):
harray[y] -= a
else:
harray[N-1] -= a
counter += a
for k in range(len(zeroarray)-1):
if zeroarray[k+1] - zeroarray[k] == 1:
continue
else:
a = min(harray[zeroarray[k]+1:zeroarray[k+1]])
for y in range(zeroarray[k]+1,zeroarray[k+1]):
harray[y] -= a
counter += a
print(counter) | p03147 |
N = int(eval(input()))
h = list(map(int, input().split()))
ans = 0
i = 0
while i < N:
while h[i] == 0:
i += 1
if i == N: break
j = i
if i == N: break
while h[j] > 0:
h[j] -= 1
j += 1
if j == N: break
ans += 1
print(ans)
| n = int(eval(input()))
h = tuple(map(int, input().split()))
ans = 0
cur = 0
for hh in h:
if cur < hh:
ans += hh - cur
cur = hh
else:
cur = hh
print(ans)
| p03147 |
def solve_range(h, frm, to):
"""[frm, to)"""
# print(frm, to, h)
if frm >= to:
return 0
res = 0
start = frm
for i in range(frm, to):
h[i] -= 1
if h[i] < 0:
if start < i:
res += solve_range(h, start, i) + 1
start = i + 1
elif i == to - 1:
res += solve_range(h, start, to) + 1
return res
def solve(h):
return solve_range(h, 0, n)
n = int(eval(input()))
h = list(map(int, input().split()))
print((solve(h))) | def main():
N = int(eval(input()))
H = list(map(int, input().split()))
cnt = 0
p = 0
for h in H:
cnt += max(0, h - p)
p = h
print(cnt)
if __name__ == '__main__':
main()
| p03147 |
N = int(eval(input()))
h = list(map(int, input().split()))
answer = h[0]
for i in range(1, N):
if h[i] > h[i-1]:
answer += h[i] - h[i-1]
print(answer)
| N = int(eval(input()))
H = list(map(int, input().split()))
ans = H[0]
tmp = H[0]
for h in H:
if tmp < h:
ans += (h-tmp)
tmp = h
print(ans)
| p03147 |
def dfs(_h):
if len(_h) == 0:
return
min_h = min(_h)
global ans
ans += min_h
tmp = []
for i in range(len(_h)):
if _h[i] == min_h:
tmp.append(i)
tmp.append(N)
head = 0
sp = []
for i in tmp:
sp.append([x - min_h for x in _h[head:i]])
head = i+1
for s in sp:
dfs(s)
N = int(eval(input()))
h = [int(x) for x in input().split()]
ans = 0
dfs(h)
print(ans) | N = int(eval(input()))
h = [int(x) for x in input().split()]
node = sum(h)
path = 0
prev = h[0]
for cur in h[1:]:
path += min(prev, cur)
prev = cur
print((node - path)) | p03147 |
N = int(eval(input()))
height = [0] + [int(i) for i in input().split()]
count = 0
for i in range(N):
if height[i+1] > height[i]:
count += height[i+1] - height[i]
print(count) | #coding:utf-8
n = int(eval(input()))
h = list(map(int, input().split()))
cnt = h[0]
for i in range(n-1):
if h[i+1] > h[i]:
cnt += h[i+1] - h[i]
print(cnt) | p03147 |
import sys
input = sys.stdin.readline
n = int(eval(input()))
h = [int(x) for x in input().split()]
ans = 0
def solve(l, r):
global ans
if l >= r:
return
if 0 not in h[l:r]:
minh = min(h[l:r])
ans += minh
for i in range(l, r):
h[i] -= minh
solve(l, r)
else:
for i in range(l, r):
if h[i] == 0:
solve(l, i)
solve(i + 1, r)
solve(0, n)
print(ans) | import sys
input = sys.stdin.readline
n = int(eval(input()))
h = [int(x) for x in input().split()]
ans = 0
def solve(l, r):
global ans
if l >= r:
return
if 0 not in h[l:r]:
minh = min(h[l:r])
ans += minh
for i in range(l, r):
h[i] -= minh
solve(l, r)
else:
for i in range(l, r):
if h[i] == 0:
solve(l, i)
l = i + 1
solve(l, r)
solve(0, n)
print(ans) | p03147 |
N = int(eval(input()))
H = [0] + list(map(int, input().split()))
count = 0
for h in range(max(H)):
for n in range(1, N + 1):
if h < H[n] and H[n - 1] <= h:
count += 1
print(count)
| import sys
# お約束
args = None
INF = float("inf")
MOD = int(1e9 + 7)
def int1(n):
return int(n) - 1
def parse(*params):
if len(params) == 1:
return params[0](next(args))
return tuple(p(v) for p, v in zip(params, next(args).split()))
def debug(*v):
if __debug__:
print(*v, file=sys.stderr)
# エントリーポイント
def main():
N = parse(int)
H = [0] + list(map(int, next(args).split()))
c = 0
debug(H)
for h in range(100):
for n in range(1, N + 1):
if H[n - 1] - h <= 0 and 0 < H[n] - h:
c += 1
print(c)
if __name__ == '__main__':
args = iter(sys.stdin.read().split("\n"))
main()
| p03147 |
N=int(eval(input()))
*H,=list(map(int,input().split()))
L=len(H)
ans=False
cnt=0
while ans==False:
cnt+=1
m=max(H)
for i in range(H.index(m), L):
if H[i]==m:
H[i]-=1
else:
break
if sum(H)==0: ans=True
print(cnt) | N=int(eval(input()))
*H,=list(map(int,input().split()))
L=len(H)
cnt=0
prv=0
for i in range(N):
if prv < H[i]:
cnt+=H[i]-prv
prv=H[i]
print(cnt) | p03147 |
N = int(eval(input()))
H = list(map(int,input().split()))
A = []
while sum(H)>0:
hmin = 101
cur = 0
for i in range(N):
h = H[i]
if h>0:
hmin = min(hmin,h)
elif hmin<=100:
A.append(hmin)
for j in range(cur,i):
H[j] -= hmin
cur = i+1
hmin = 101
else:
cur = i+1
if cur<N:
A.append(hmin)
for j in range(cur,N):
H[j] -= hmin
hmin = 101
print((sum(A))) | N = int(eval(input()))
H = list(map(int,input().split()))
cnt = 0
while True:
flag = 0
for i in range(N):
if H[i]>0:
cur = i
flag = 1
break
if flag==0:break
cmin = H[cur]
flag = 1
for i in range(cur,N):
if H[i]>0 and flag==1:
cmin = min(cmin,H[i])
elif H[i]>0 and flag==0:
cur = i
cmin = H[i]
flag = 1
else:
cnt += cmin
for k in range(cur,i):
H[k] -= cmin
cur = i
cmin = 0
flag = 0
cnt += cmin
for k in range(cur,N):
H[k] -= cmin
print(cnt) | p03147 |
N = int(eval(input()))
H = list(map(int,input().split()))
cnt = 0
while True:
flag = 0
for i in range(N):
if H[i]>0:
cur = i
flag = 1
break
if flag==0:break
cmin = H[cur]
flag = 1
for i in range(cur,N):
if H[i]>0 and flag==1:
cmin = min(cmin,H[i])
elif H[i]>0 and flag==0:
cur = i
cmin = H[i]
flag = 1
else:
cnt += cmin
for k in range(cur,i):
H[k] -= cmin
cur = i
cmin = 0
flag = 0
cnt += cmin
for k in range(cur,N):
H[k] -= cmin
print(cnt) | N = int(eval(input()))
H = list(map(int,input().split()))
tot = 0
while True:
if H[0]>0:
cnt = 1
else:
cnt = 0
for i in range(1,N):
if H[i]>0 and H[i-1]==0:
cnt += 1
tot += cnt
for i in range(N):
if H[i]>0:
H[i] -= 1
flag = 0
for i in range(N):
if H[i]>0:
flag = 1
break
if flag==0:break
print(tot) | p03147 |
n = int(eval(input()))
li_h = list(map(int,input().split()))
li_a = [0]*n
ans = 0
li_count = [True]*100
while True:
for i in range(n):
if li_h[i] == 0:
li_count[i] = False
temp = li_count[0]
if temp == True:
count = 1
else:
count = 0
for i in range(n):
if temp != li_count[i]:
temp = li_count[i]
if temp == True:
count += 1
ans += count
for i in range(n):
if li_h[i] != 0:
li_h[i] -= 1
if li_h == li_a:
break
print(ans)
| n = int(eval(input()))
a = [int(i) for i in input().split()]
a.append(-1)
ans = 0
while max(a):
max_a = max(a)
i = 0
while i < n and i >= 0:
if a[i] == max_a:
a[i] -= 1
while a[i+1] == max_a:
i += 1
a[i] -= 1
ans += 1
i += 1
print(ans)
| p03147 |
import math
from math import gcd
INF = float("inf")
import sys
input=sys.stdin.readline
sys.setrecursionlimit(500*500)
import itertools
from collections import Counter,deque
def main():
n = int(eval(input()))
h = list(map(int, input().split()))
l = [[0]*100 for _ in range(100)]
for i in range(len(h)):
k = h[i]
for q in range(k):
l[i][q] = 1
l = [list(x) for x in zip(*l)]
ans = 0
for i in l:
flg = 0
for g in i:
if g == 1:
if flg == 0:
ans += 1
flg = 1
if g == 0:
flg = 0
print(ans)
if __name__=="__main__":
main()
| n = int(eval(input()))
h = list(map(int,input().split()))
ans = 0
pre = 0
for i in h:
if pre < i:
ans += i-pre
pre = i
print(ans)
| p03147 |
n,*h=list(map(int,open(0).read().split()));print((sum(max(0,b-a)for a,b in zip([0]+h[:-1],h)))) | eval(input());s=p=0
for x in map(int,input().split()):s+=max(x-p,0);p=x
print(s) | p03147 |
n = int(eval(input()))
lis = list(map(int,input().split()))
ans = 0
co = 0
for i in range(n):
while lis[i] != 0:
cou = i
while lis[cou] > 0:
lis[cou] -= 1
cou += 1
if cou == n:
break
ans += 1
print(ans) | n= int(eval(input()))
lis = list(map(int,input().split()))
ans = 0
status = 0
for high in range(1,101):
for i in range(n):
if lis[i] >= high:
status = 1
else:
if status == 1:
ans += 1
status = 0
ans += status
status = 0
print(ans) | p03147 |
import itertools
import math
import fractions
import functools
import copy
n = int(eval(input()))
h = list(map(int, input().split()))
ans = 0
active = 0
for i in range(n):
if h[i] <= active:
active = h[i]
else:
ans += h[i] - active;
active = h[i]
print(ans) | def main():
n = int(eval(input()))
# n, m = map(int, input().split())
h = list(map(int, input().split()))
# s = input()
# h = [int(input()) for _ in range(n)]
count = 0
h.append(0)
for j in range(max(h)):
for i in range(n):
if h[i] != 0 and h[i+1] == 0:
count += 1
if h[i] != 0:
h[i] -= 1
print(count)
if __name__ == '__main__':
main()
| p03147 |
from collections import deque
def sol():
q = deque()
q.append(H)
ans = 0
while len(q) != 0:
prv_H = q.pop()
min_h = min(prv_H)
ans += min_h
tmp_H = ''.join([',' if h-min_h == 0 else str(h-min_h)+' ' for h in prv_H])
for sub_H in tmp_H.split(','):
if len(sub_H.replace(' ','')) != 0 :
q.append([int(h) for h in sub_H.split()])
#print(ans, q)
return ans
N = int(eval(input()))
H = list(map(int,input().split()))
print((sol()))
| import itertools
def get_num_1group(input_list):
num_group = 0
for key, elems in itertools.groupby(input_list):
if key == 1:
num_group += 1
return num_group
N = int(eval(input()))
H = list(map(int, input().split()))
maxH = max(H)
hist = [[0 for _ in range(N)] for _ in range(maxH)]
for idx, h in enumerate(H):
for num in range(h):
hist[num][idx] = 1
print((sum([get_num_1group(hist[num]) for num in range(maxH)]))) | p03147 |
n = int(eval(input()))
h = list(map(int, input().split()))
ans = h[0]
for i in range(1, n):
ans += max(0, h[i]-h[i-1])
print(ans) | N = int(eval(input()))
H = list(map(int,input().split()))
last = 0
ans = 0
for h in H:
if h >= last:
ans += h - last
else:
if last == 0:
ans += h
last = h
print(ans)
| p03147 |
n = int(eval(input()))
h = list(map(int, input().split()))
cnt = 0
while max(set(h)) > 0:
flg = False
for i in h:
if i <= 0:
flg = False
continue
else:
if not flg:
cnt += 1
flg = True
h = list([x-1 for x in h])
print(cnt) | n = int(eval(input()))
h = list(map(int, input().split()))
ans = h[0]
for i in range(n-1):
ans += h[i+1] - h[i] if h[i] < h[i+1] else 0
print(ans) | p03147 |
n=int(eval(input()))
Tree_List=list(map(int,input().split()))
ct =0
for i in range(n):
while Tree_List[i] != 0:
k = i
while k + 1 < n and Tree_List[k + 1] != 0:
k+=1
Tree_List[i:k + 1]=[x-1 for x in Tree_List[i:k + 1]]
ct += 1
print(ct) | n=int(eval(input()))
Tree_List=list(map(int,input().split()))
ct =0
for i in range(n):
while Tree_List[i] != 0:
k = i + 1
while k < n and Tree_List[k] != 0:
k+=1
Tree_List[i:k]=[x-1 for x in Tree_List[i:k]]
ct += 1
print(ct)
| p03147 |
s = int(eval(input()))
a = list(map(int, input().split()))
incFlg = True #登る場合はTure, 降る場合はFalse
before_height = 0
sum = 0
for i in range(len(a)-1):
#降る場合
if a[i] > a[i+1]:
#その前が登り
if incFlg:
sum += a[i] - before_height
incFlg = False
#その前が下り
else:
before_height = a[i]
#登る場合
else:
if not incFlg:
before_height = a[i]
incFlg = True
if incFlg:
sum += a[len(a)-1] - before_height
print(sum)
| s = int(eval(input()))
a = list(map(int, input().split()))
incFlg = True #登る場合はTure, 降る場合はFalse
before_height = 0
sum = 0
for i in range(len(a)-1):
#降る場合
if a[i] > a[i+1]:
#その前が登り
if incFlg:
sum += a[i] - before_height
incFlg = False
#その前が下り
# else:
# # before_height = a[i]
#登る場合
else:
if not incFlg:
before_height = a[i]
incFlg = True
if incFlg:
sum += a[len(a)-1] - before_height
print(sum)
| p03147 |
n=int(eval(input()))
h=list(map(int,input().split()))
ans=0
while sum(h)>0:
i=0
while i < n:
if h[i]>0:
ans+=1
while i<n and h[i]>0:
h[i]-=1
i+=1
i+=1
print(ans) | n=int(eval(input()))
h=list(map(int,input().split()))
ans=0
pre=0
for hi in h:
if hi-pre>0:
ans+=hi-pre
pre=hi
print(ans) | p03147 |
N = int(eval(input()))
H = list(map(int, input().split()))
H.append(0)
t = 1
ans = 0
while t > 0:
p = H[-1]
t = 0
for i in range(N):
if H[i] > 0 and p <= 0:
ans += 1
p = H[i]
H[i] -= 1
t = max(H[i], t)
#print(ans, H[i], t)
print(ans)
| N = int(eval(input()))
H = list(map(int, input().split()))
ans = 0
pre = 0
for h in H:
if pre < h:
ans += h - pre
pre = h
print(ans)
| p03147 |
N = int(eval(input()))
h = list(map(int, input().split()))
ans = 0
for h_ref in range(1, 101):
prev = 0
for i, hi in enumerate(h):
curr = int(hi >= h_ref)
if curr > prev: ans += 1
prev = curr
print(ans) | N = int(eval(input()))
h = list(map(int, input().split()))
h += [0]
prev = 0
imos = [None] * (N + 1)
for i in range(N + 1):
imos[i] = h[i] - prev
prev = h[i]
# print("#", h)
# print("#", imos)
ans = sum([int(item > 0) * item for item in imos])
print(ans) | p03147 |
def solve(l):
if len(l)<2:
return max(0,l[0])
m=10**18
a=0
for i in range(len(l)):
if l[i]<1:
if i+1<len(l):
a+=solve(l[i+1:])
else:
l=l[:i]
break
m=min(m,l[i])
l=l[:i+1]
for i in range(len(l)):
l[i]-=m
return solve(l)+a+m*(m!=10**18)
n=int(eval(input()))
*h,=list(map(int,input().split()))
print((solve(h))) | def solve(h):
if len(h)<2:
return h[0]
s=[i for i in range(len(h))if h[i]<1]
s=[-1]+s+[len(h)]
a=0
for l in[h[i+1:j]for i,j in zip(s,s[1:])]:
if not l:continue
v=min(l)
l=[t-v for t in l]
a+=v+solve(l)
return a
eval(input())
print((solve(list(map(int,input().split()))))) | p03147 |
N = int(eval(input()))
H = list(map(int, input().split()))
is_init = True
is_end = False
ans = 0
while not is_end:
is_init = True
for i in range(N):
h = H[i]
if h <= 0:
if i == N - 1 and is_init:
is_end = True
H[i] -= 1
else:
is_init = False
if i - 1 >= 0:
pre = H[i - 1]
if pre <= -1:
ans += 1
else:
if h != 0:
ans += 1
H[i] -= 1
print(ans) | N = int(eval(input()))
H = list(map(int, input().split()))
ans = H[0]
active = H[0]
for i in range(1,N):
h = H[i]
ans += max(0, h - active)
active = h
print(ans)
| p03147 |
a = int(eval(input()))
b = [int(i) for i in input().split()]
numbers = min(b)
b = [i - min(b) for i in b]
theend = False
while theend == False:
if b.count(0) == a:
theend = True
break
indexnotzero = 0
for i in range(len(b)):
if b[i] == 0:
continue
else:
indexnotzero = i
break
if indexnotzero == len(b) - 1:
numbers += b[len(b) - 1]
break
try:
length = b.index(0, indexnotzero)
except ValueError:
length = len(b)
minimum = min(b[indexnotzero:length])
numbers += minimum
b[indexnotzero:length] = [i - minimum for i in b[indexnotzero:length]]
print(numbers) | a = int(eval(input()))
b = [int(i) for i in input().split()]
numbers = 0
theend = False
while theend == False:
if b.count(0) == a:
theend = True
break
indexnotzero = 0
for i in range(len(b)):
if b[i] == 0:
continue
else:
indexnotzero = i
break
if indexnotzero == len(b) - 1:
numbers += b[len(b) - 1]
break
try:
length = b.index(0, indexnotzero)
except ValueError:
length = len(b)
minimum = min(b[indexnotzero:length])
numbers += minimum
b[indexnotzero:length] = [i - minimum for i in b[indexnotzero:length]]
print(numbers) | p03147 |
a = int(eval(input()))
b = [int(i) for i in input().split()]
numbers = 0
theend = False
while theend == False:
if b.count(0) == a:
theend = True
break
indexnotzero = 0
for i in range(len(b)):
if b[i] == 0:
continue
else:
indexnotzero = i
break
if indexnotzero == len(b) - 1:
numbers += b[len(b) - 1]
break
try:
length = b.index(0, indexnotzero)
except ValueError:
length = len(b)
minimum = min(b[indexnotzero:length])
numbers += minimum
b[indexnotzero:length] = [i - minimum for i in b[indexnotzero:length]]
print(numbers) | N = int(eval(input()))
lis_h = list(map(int, input().split()))
water = 0
before = 0
for i in lis_h:
if i > before:
water += i - before
before = i
print(water) | p03147 |
n = int(eval(input()))
h = list(map(int, input().split()))
h.insert(0, 0)
h.append(0)
cnt = 0
while True:
s = -1
e = -1
m_n = 10 ** 10
for i in range(1, n + 2):
if h[i] != 0 and h[i-1] == 0:
s = i
m_n = min(m_n, h[i])
for j in range(i + 1, n + 2):
if h[j] == 0 and h[j - 1] != 0:
e = j - 1
break
else:
m_n = min(m_n, h[j])
if s == -1 and e == -1:
print(cnt)
exit()
else:
cnt += m_n
for i in range(s, e + 1):
h[i] -= m_n
| def slove():
import sys
input = sys.stdin.readline
n = int(input().rstrip('\n'))
h = list(map(int, input().rstrip('\n').split()))
l = 0
cnt = 0
for i in range(n):
if l < h[i]:
cnt += h[i] - l
l = h[i]
print(cnt)
if __name__ == '__main__':
slove()
| p03147 |
n = int(eval(input()))
h = list(map(int, input().split()))
t = [0] * n
ans = 0
for i in range(n):
while t[i] < h[i]:
for j in range(i, n):
if t[j] < h[j]:
t[j] += 1
else:
break
ans += 1
print(ans) | n = int(eval(input()))
h = list(map(int, input().split()))
s = [0] * n
cnt = 0
while True:
flag = 0
for i in range(n):
if h[i] != s[i]:
s[i] += 1
flag = 1
elif h[i] == s[i] and flag:
cnt += 1
flag = 0
if flag:
cnt += 1
if h == s:
break
print(cnt) | p03147 |
N = int(eval(input()))
H = list(map(int, input().split()))
cnt = 0
while any(H):
st = False
for i, v in enumerate(H):
# print(H, cnt)
# print(v)
if v > 0:
st = True
H[i] -= 1
# print(H)
else:
if st == True:
cnt += 1
st = False
break
if st == True:
cnt += 1
st = False
print(cnt)
| n = int(eval(input()))
H = [0] + list(map(int, input().split())) + [0]
ans = sum([max(0, j - i) for i, j in zip(H, H[1:])])
print(ans) | p03147 |
n = int(eval(input()))
h = list(int(i) for i in input().split())
count = 0
while not all(i==0 for i in h):
if 0 in h:
zero_index = [i for i,x in enumerate(h) if x==0]
for i in range(len(zero_index)):
if i==0:
if not all(h[j]==0 for j in range(zero_index[i])):
for j in range(zero_index[i]):
h[j] -= 1
count += 1
elif i==len(zero_index)-1 and not zero_index[i]==n-1:
if not all(h[j]==0 for j in range(zero_index[i]+1,n)):
for j in range(zero_index[i]+1,n):
h[j] -= 1
count += 1
else:
if not all(h[j]==0 for j in range(zero_index[i-1]+1,zero_index[i])):
for j in range(zero_index[i-1]+1, zero_index[i]):
h[j] -= 1
count += 1
else:
for i in range(n):
h[i] -=1
count += 1
print(count) | n = int(eval(input()))
h = list(int(i) for i in input().split())
count = 0
while not all(height==0 for height in h):
index = [i for i,x in enumerate(h) if not x==0]
for i in range(len(index)):
h[index[i]] -= 1
if not i==0:
if index[i]-index[i-1]>1:
count += 1
count += 1
print(count) | p03147 |
n=int(eval(input()))
h=[int(i) for i in input().split()]
j=0
ans=0
while True:
if h[0]>j:
ans+=1
for i in range(1,n):
if h[i-1]<=j and h [i]>j:
ans+=1
j+=1
if j==max(h):
break
print(ans) | n=int(eval(input()))
h=[int(i) for i in input().split()]
j=0
ans=0
while j<max(h):
if h[0]>j:
ans+=1
for i in range(1,n):
if h[i-1]<=j and h [i]>j:
ans+=1
j+=1
print(ans) | p03147 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.