input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
n = int(eval(input()))
h = [int(i) for i in input().split()]
ans = 'Yes'
for i in range(n - 1, 0, -1):
d = h[i - 1] - h[i]
if d >= 2:
ans = 'No'
break
elif d == 1:
h[i - 1] -= 1
print(ans) | n = int(eval(input()))
h = list(map(int, input().split()))
ans = 'Yes'
for i in range(n - 1, 0, -1):
d = h[i - 1] - h[i]
if d >= 2:
ans = 'No'
break
elif d == 1:
h[i - 1] -= 1
print(ans) | p02953 |
import sys
n = int(eval(input()))
h = [int(e) for e in input().split()]
for i in range(n - 2, 0, -1):
if h[i] > h[i + 1]:
h[i] -= 1
if h[i] > h[i + 1]:
print('No')
sys.exit()
print('Yes')
| from sys import exit
N = int(eval(input()))
H = list(map(int, input().split()))
for i in range(N - 2, 0, -1):
if H[i] <= H[i + 1]:
continue
H[i] -= 1
if H[i] > H[i + 1]:
print('No')
exit()
print('Yes')
| p02953 |
import sys
import random
N = int(eval(input()))
H = [int(x) for x in input().split()]
if N==1:
print("Yes")
sys.exit()
K_left=H[1]-H[0]
if K_left<-1:
print("No")
sys.exit()
elif K_left == -1 :
L_left='-'
elif K_left == 0 :
L_left='0'
else:
L_left='+'
for i in range(1,N-1):
K_right=H[i+1]-H[i]
if K_right < -1:
print("No")
sys.exit()
elif K_right == -1 :
L_right='-'
elif K_right == 0 :
L_right='0'
else:
L_right='+'
if L_left =='-' and L_right=='-':
print("No")
sys.exit()
if L_left =='0' and L_right=='-':
if max(H[0:i]) <= H[i]:
L_left=L_right
K_left=K_right
else:
print("No")
sys.exit()
else:
L_left=L_right
K_left=K_right
print("Yes") | import sys
import random
N = int(eval(input()))
H = [int(x) for x in input().split()]
if N==1:
print("Yes")
sys.exit()
K_left=H[1]-H[0]
if K_left<-1:
print("No")
sys.exit()
elif K_left == -1 :
L_left='-'
elif K_left == 0 :
L_left='0'
else:
L_left='+'
maxH=max(H[1],H[0])
for i in range(1,N-1):
K_right = H[i+1]-H[i]
if K_right < -1:
print("No")
sys.exit()
elif K_right == -1 :
L_right='-'
elif K_right == 0 :
L_right='0'
else:
L_right='+'
if L_left =='-' and L_right=='-':
print("No")
sys.exit()
if L_left =='0' and L_right=='-':
if maxH <= H[i]:
L_left=L_right
K_left=K_right
else:
print("No")
sys.exit()
else:
L_left=L_right
K_left=K_right
maxH=max(H[i+1],maxH)
print("Yes") | p02953 |
import sys
fin = sys.stdin.readline
N = [int(elem) for elem in fin().split()][0]
h_list = [int(elem) for elem in fin().split()]
original_h_list = [x for x in h_list]
flag = True
result = 'Yes'
h_list = [-1] + h_list + [10**10]
for i in range(1, len(h_list)-1):
# print(h_list[i])
min_right_h = min(h_list[i+1:])
if h_list[i] <= min_right_h:
# 右側最小値以下の場合
if h_list[i] >= h_list[i-1]:
# 左側の値以上の場合
continue
else:
# 右側最小値以上の場合
h_list[i] -= 1
if min_right_h >= h_list[i] >= h_list[i - 1]:
continue
else:
result = 'No'
flag = False
if not flag:
break
print(result)
| import sys
fin = sys.stdin.readline
N = [int(elem) for elem in fin().split()][0]
h_list = [int(elem) for elem in fin().split()]
original_h_list = [x for x in h_list]
flag = True
result = 'Yes'
h_list = [-1] + h_list + [10**10]
min_h_list = min(h_list[1:-1])
for i in range(1, len(h_list)-1):
if h_list[i] - 1 >= h_list[i-1]:
h_list[i] -= 1
for i in range(1, len(h_list)-1):
if not (h_list[i-1] <= h_list[i] <= h_list[i+1]):
result = 'No'
print(result)
| p02953 |
n = int(eval(input()))
h = list(map(int,input().split()))
for i in range(1,n):
if h[i] > h[i-1]:
h[i] -= 1
else:
pass
l = list(h)
l.sort()
if h == l:
print('Yes')
else:
print('No') | n = int(eval(input()))
h = list(map(int,input().split()))
h[0] -= 1
for i in range(1,n):
if h[i-1] < h[i]:
h[i] -= 1
l = list(h)
l.sort()
if h == l:
print('Yes')
else:
print('No') | p02953 |
n = int(eval(input()))
h = list([int(x) for x in input().split()])
f, mx = 0, 0
for hi in h:
if hi > mx: mx = hi
if hi <= (mx-2): f = 1; break
print(('YNeos'[f::2])) | n = int(eval(input()))
h = list(map(int, input().split()))
f, mx = 0, 0
for hi in h:
if hi > mx: mx = hi
if hi <= (mx-2): f = 1; break
print(('YNeos'[f::2])) | p02953 |
n = int(eval(input()))
h = list(map(int, input().split()))
w = 1
for i in range(n-1):
if h[i] - h[i+1] >= 2:
w = 0
for j in range(n-2):
if h[j] - h[j+1] == 1:
for k in range(j,n-2):
if h[k+1] - h[k+2] == 0:
continue
if h[k+1] - h[k+2] == 1:
w = 0
break
break
if w == 0:
print("No")
else:
print("Yes") | n = int(eval(input()))
h = list(map(int,input().split()))
answer = "Yes"
for i in range(n-2,0,-1):
if h[i] > h[i+1] + 1:
answer = "No"
break
elif h[i] == h[i+1] +1:
h[i] -= 1
print(answer) | p02953 |
N=int(eval(input()))
H=list(map(int,input().split()))
for i in range(1,N-1):
if max(H[:i])-1>H[i+1]:
print("No")
break
else:
print("Yes") | N=int(eval(input()))
H=list(map(int,input().split()))
a=0
for i in range(N-1):
if a<H[i]:
a=H[i]
if a-1>H[i+1]:
print("No")
break
else:
print("Yes") | p02953 |
import sys
n, hl = sys.stdin.readlines()
n = int(n)
hl = list(map(int, hl.split()))
for i in range(n-1, 0, -1):
if hl[i] - hl[i-1] ==-1:
hl[i-1]-=1
if hl == sorted(hl):
print('Yes')
else:
print('No') | import sys
n = int(sys.stdin.readline())
H = list(map(int, sys.stdin.readline().split()))
for i in range(n-1, 0,-1):
if H[i] - H[i-1] ==-1:
H[i-1]-=1
if sorted(H) == H:
print('Yes')
else:
print('No') | p02953 |
N = int(eval(input()))
H = list(map(int, input().split()))
flg = False
for i in range(1,N+1):
if flg:
tmp = H[-i]-1
else:
tmp = H[-i]
flg = False
if not i==N:
if tmp < H[-i-1]:
if tmp == H[-i-1]-1:
flg = True
else:
print('No')
exit()
print('Yes') | N = int(eval(input()))
H = list(map(int, input().split()))
for i in range(1,N+1):
tmp = H[-i]
if not i==N:
if tmp < H[-i-1]:
if tmp == H[-i-1]-1:
H[-i-1] -= 1
else:
print('No')
exit()
print('Yes')
| p02953 |
# -*- coding: utf-8 -*-
import copy
N = int(eval(input()))
H = list(map(int, input().split()))
H_bak = copy.copy(H)
while H != sorted(H):
for i in range(N-1):
while H[i] > H[i+1]:
H[i] -= 1
if all([abs(H[i]-H_bak[i]) < 2 for i in range(N)]):
print("Yes")
else:
print("No")
| # -*- coding: utf-8 -*-
N = int(eval(input()))
H = list(map(int, input().split()))
m = 0
ans = "Yes"
for i in range(N):
if m - H[i] > 1:
ans = "No"
break
m = max(m, H[i])
print(ans)
| p02953 |
# ABC136 C - Build Stairs
n = int(eval(input()))
h = list(map(int,input().split()))
for i in range(len(h)-1):
if h[i] - min(h[i+1:]) >= 2:
print('No')
exit()
print('Yes') | N=int(eval(input()))
H=list(map(int,input().split()))
base=0
for h in H:
if base>h:
print("No")
break
base=max(base,h-1)
else:
print("Yes") | p02953 |
N=int(eval(input()))
H=list(map(int,input().split()))
if N==1:
print("Yes")
exit()
for i in range(N-1):
if H[i]-1<=H[i+1]:
if i!=0:
if H[i-1]<H[i]:
H[i]-=1
elif H[i]==H[i+1]:
continue
else:
print("No")
exit()
for i in range(N-1):
if H[i]>H[i+1]:
print("No")
exit()
print("Yes") | N=int(eval(input()))
H=list(map(int,input().split()))
if N==1:
print("Yes")
exit()
if H[0]<H[1]:
H[0]-=1
elif H[0]>H[1]:
print("No")
exit()
for i in range(1,N):
if H[i-1]<H[i]:
H[i]-=1
elif H[i-1]>H[i]:
print("No")
exit()
print("Yes") | p02953 |
n = int(eval(input()))
x = list(map(int, input().split(' ')))
for i in range(n-1):
for j in range(i+1, n):
if x[i] - x[j] >= 2:
print('No')
exit()
print('Yes') | n = int(eval(input()))
x = list(map(int, input().split(' ')))
now = 0
for i in range(n):
if now < x[i]:
now = x[i] - 1
if now > x[i]:
print('No')
exit()
print('Yes') | p02953 |
n = int(eval(input()))
stair = input().split(' ')
for i in range(0, n - 1):
if (int(stair[i]) < int(stair[i+1])):
stair[i+1] = int(stair[i+1]) - 1
if (int(stair[i]) > int(stair[i+1])):
print("No")
exit()
print("Yes")
| n = int(eval(input()))
stair = input().split(' ')
stair[0] = int(stair[0]) - 1
for i in range(0, n - 1):
if (int(stair[i]) < int(stair[i+1])):
stair[i+1] = int(stair[i+1]) - 1
if (int(stair[i]) > int(stair[i+1])):
print("No")
exit()
print("Yes")
| p02953 |
n = int(eval(input()))
arr = list(map(int, input().split()))
for i in range(n):
if i == 0:
continue
if arr[i] < arr[i-1]:
print("No")
exit()
if arr[i] > arr[i-1]:
arr[i] -= 1
print("Yes") | N = int(eval(input()))
H = list(map(int, input().split()))
a = H[0]
for i in range(1,N-1):
a = max(H[i], a)
b = H[i+1]
if a - b >= 2:
print("No")
exit()
print("Yes") | p02953 |
N = int(eval(input()))
H=[int(x) for x in input().split()]
ans='Yes'
for n in range(N-1,0,-1):
num=H[n]
check=max(set(H[:n]))
if check > num+1:
ans='No'
print(ans) | N=int(eval(input()))
H=[int(x) for x in input().split()]
max_h=0
ans='Yes'
for n in range(N):
if H[n] > max_h:
max_h = H[n]
if H[n] < max_h-1:
ans='No'
print(ans) | p02953 |
N = int(eval(input()))
H = list(map(int, input().split()))
mx = max(H)
ind = H.index(max(H))
if ind != N - 1 and mx - min(H[ind+1:]) > 1:
print("No")
exit()
for i in range(N-1):
if H[i] - min(H[i+1:]) > 1:
print("No")
exit()
print("Yes") | N = int(eval(input()))
H = list(map(int, input().split()))
r_H = list(reversed(H))
for i in range(N-1):
if r_H[i+1] - r_H[i] > 1:
print("No")
exit()
if r_H[i+1] - r_H[i] == 1:
r_H[i+1] = r_H[i+1] - 1
print("Yes") | p02953 |
N = int(eval(input()))
H = list(map(int,input().split()))
a = []
cnt = 0
for i in range(N-1):
if cnt-H[i]>1:
print("No")
exit()
elif H[i]>H[i+1] and H[i]-H[i+1]==1:
a.append(H[i]-1)
cnt = max(cnt,H[i])
elif H[i]<=H[i+1]:
a.append(H[i])
cnt = max(cnt,H[i])
else:
print("No")
exit()
if cnt-H[N-1]>1:
print("No")
exit()
print("Yes")
| N = int(eval(input()))
H = list(map(int,input().split()))
for i in range(N-2,-1,-1):
if H[i]>H[i+1] and H[i]-H[i+1]==1:
H[i] = H[i]-1
elif H[i]<=H[i+1]:
H[i] = H[i]
else:
print("No")
exit()
print("Yes")
| p02953 |
import sys
input = sys.stdin.readline
n=int(eval(input()))
h=list(map(int,input().split()))
l=h
s=[]
t=max(h)
for i in range(n-1):
if l[i]-1==l[i+1]:
l[i]=l[i]-1
s.append(l[i])
elif l[i]==l[i+1] and l[i]==t:
l[i]=l[i]-1
s.append(l[i])
elif l[i]-1>l[i+1]:
break
elif l[i]-1<l[i+1]:
s.append(l[i])
continue
s.append(h[n-1])
s.sort()
if len(s)==n:
if l==s:
print('Yes')
else:
print('No')
else:
print('No')
| n=int(eval(input()))
h=list(map(int,input().split()))
if n==1:
print('Yes')
else:
c=0
for i in range(n):
if c<h[i]:
h[i]-=1
c=h[i]
elif c==h[i]:
c=h[i]
else:
print('No')
break
else:
print('Yes')
| p02953 |
from functools import reduce
_ = eval(input())
H = tuple(map(int, input().split()))
HH = reduce(lambda a, b: a+[b-1 if a[-1] < b else b], reversed(H), [float('inf')])
print(("Yes" if all(h1 >= h2 for h1, h2 in zip(HH, HH[1:])) else "No")) | from functools import reduce
def f(m, h):
if h < m - 1:
return float('inf')
return max(m, h)
_ = eval(input())
H = tuple(map(int, input().split()))
print(("No" if reduce(f, H) >= float('inf') else "Yes"))
| p02953 |
n = int(eval(input()))
h = list(map(int, input().split()))
ans = "Yes"
for i in range(1, n):
if h[i] > h[i-1]:
h[i] -= 1
if h == sorted(h):
print("Yes")
else:
print("No")
| import sys
sys.setrecursionlimit(10 ** 7)
f_inf = float('inf')
mod = 10 ** 9 + 7
def resolve():
n = int(eval(input()))
H = list(map(int, input().split()))
for i in range(1, n):
if H[i - 1] < H[i]:
H[i] -= 1
for j in range(1, n):
if H[j - 1] > H[j]:
print("No")
break
else:
print("Yes")
if __name__ == '__main__':
resolve()
| p02953 |
N = int(eval(input()))
H = [int(h) for h in input().split()]
if N == 1:
ans = "Yes"
else:
c = 0
while c <= N-2:
if H[c] < H[c+1]:
H[c+1] -= 1
c += 1
List = []
for j in range(N):
List.append(H[j])
List.sort()
if List == H:
ans = "Yes"
else:
ans = "No"
print(ans) | N = int(eval(input()))
H = [int(h) for h in input().split()]
ans = "Yes"
for i in range(1, N-1):
if H[i] > H[i-1]:
H[i] -= 1
if H[i] > H[i+1]:
ans = "No"
break
print(ans) | p02953 |
N = int(eval(input()))
Hs = [int(i) for i in input().split()]
is_Yes = True
for i in range(1, N):
if Hs[i-1] == Hs[i]:
continue
elif Hs[i] > Hs[i-1]:
Hs[i] -= 1
else:
is_Yes = False
break
if is_Yes:
print('Yes')
else:
print('No')
| n = int(eval(input()))
nums = [int(num) for num in input().split()]
def solve(nums):
nums[0] -= 1
for i in range(1, n):
if nums[i] > nums[i-1]:
nums[i] -= 1
continue
if nums[i] < nums[i-1]:
return 'No'
return 'Yes'
print((solve(nums)))
| p02953 |
n = int(eval(input()))
h = list(map(int, input().split()))
h.reverse()
for i in range(n-1):
diff = h[i+1] - h[i]
if diff == 1:
h[i+1] -= 1
elif diff > 1:
print('No')
exit()
else:
pass
print('Yes') | n = int(eval(input()))
h = list(map(int, input().split()))
h.reverse()
for i in range(n-1):
d = h[i+1] - h[i]
if d == 1:
h[i+1] -= 1
elif d > 1:
print('No')
exit()
else:
pass
print('Yes') | p02953 |
N = int(eval(input()))
H = [i for i in map(int, input().split())]
ans ='Yes'
for idx in range(N):
k = H[idx]
for j in range(idx+1, N):
if k - H[j] > 1:
ans = 'No'
print(ans)
| N = int(eval(input()))
H = [i for i in map(int, input().split())]
ans ='Yes'
temp_max =H[0]
for idx in range(N):
if temp_max - H[idx] > 1:
ans = 'No'
break
if temp_max < H[idx]:
temp_max=H[idx]
print(ans)
| p02953 |
import sys
N = int(eval(input()))
H = list(map(int, input().split()))
m = 0
for h in H:
if m <= h-1 or m-1 <= h:
m = max(m, h)
else:
print("No")
sys.exit()
print("Yes")
| import sys
N = int(eval(input()))
H = list(map(int, input().split()))
m = 0
for h in H:
if m-1 <= h:
m = max(m, h)
else:
print("No")
sys.exit()
print("Yes")
| p02953 |
n = int(eval(input()))
h = [int(x) for x in input().split()]
lmax = h[0]
for i in range(1, n-1):
lmax = max(lmax, h[i])
if lmax - h[i+1] >= 2:
print('No')
exit()
print('Yes')
| n = int(eval(input()))
h = list(map(int, input().split()))
x = h[0]
for i in range(1, n):
x = max(x, h[i])
if h[i] - x < -1:
print('No')
exit()
print('Yes')
| p02953 |
#!/usr/bin/env python
# coding: utf-8
def ri():
return int(eval(input()))
def rl():
return list(input().split())
def rli():
return list(map(int, input().split()))
def main():
n = ri()
lh = rli()
for i in range(len(lh)-1):
if lh[i+1] > lh[i]:
lh[i+1] -= 1
if lh[i+1] < lh[i]:
print("No")
return
print("Yes")
if __name__ == '__main__':
main()
| #!/usr/bin/env python
# coding: utf-8
def ri():
return int(eval(input()))
def rl():
return list(input().split())
def rli():
return list(map(int, input().split()))
def main():
n = ri()
lh = rli()
c = 0
for h in lh:
# print(c, h)
if h < c:
print("No")
return
elif h == c:
c = h
else:
c = h-1
print("Yes")
if __name__ == '__main__':
main()
| p02953 |
N=int(eval(input()))
H=list(map(int,input().split()))
flag=True
for i in range(1,N):
if H[i]>H[i-1]:
H[i]-=1
elif H[i]==H[i-1]:
pass
elif H[i]<H[i-1]:
flag=False
print(("Yes" if flag else "No")) | N=int(eval(input()))
H=list(map(int,input().split()))
pre=0
for h in H:
if h<pre:
print("No");exit()
elif h>pre:
pre=h-1
print("Yes") | p02953 |
n = int(eval(input()))
h = [int(i) for i in input().split()]
x = True
c = 0
for i in range(n):
if i > 0 and h[i - 1] - h[i] >= 2:
x = False
break
elif i > 0 and h[i - 1] - h[i] == 1:
c += 1
elif i > 0 and h[i] > h[i - 1] and c == 1:
c = 0
if c == 2:
x = False
break
if x:
print("Yes")
else:
print("No") | n = int(eval(input()))
h = [int(i) for i in input().split()]
for i in range(n - 1, 0, -1):
d = h[i - 1] - h[i]
if d > 1:
print("No")
break
if d == 1:
h[i - 1] -= 1
else:
print("Yes") | p02953 |
n = int(eval(input()))
h = list(map(int, input().split()))
def is_stairs(h):
if len(h) == 1:
return('Yes')
for i in range(2, len(h)):
if h[i-1] - h[i] > 1:
return('No')
h[i] = max(h[i-1],h[i])
return('Yes')
print((is_stairs(h))) | n = int(eval(input()))
h = list(map(int, input().split()))
def is_stairs(h):
if len(h) == 1:
return('Yes')
for i in range(1, len(h)):
if h[i-1] - h[i] > 0:
return('No')
h[i] = max(h[i-1],h[i]-1)
#print(h)
return('Yes')
print((is_stairs(h))) | p02953 |
import sys
N = int(eval(input()))
Hs = list(map(int, input().split()))
prev_h = -1
downflg = False
for h in Hs:
# 増加中
if not downflg:
if h - prev_h >= 0:
prev_h = h
elif h - prev_h == -1:
downflg = True
prev_h = h
else:
print("No")
sys.exit()
# 減少中
else:
if h - prev_h > 0:
downflg = False
prev_h = h
if h - prev_h == 0:
prev_h = h
else:
print("No")
sys.exit()
# print(h,prev_h,downflg)
prev_h = h
print("Yes") | N = int(eval(input()))
Hs = list(map(int, input().split()))[::-1]
# 後ろから貪欲のほうが良くない？
pre = 10**10
for h in Hs:
# print(h)
if pre - h >= 0:
pre = h
elif pre - h == -1:
pre = h -1
else:
print("No")
exit(0)
print("Yes") | p02953 |
N=int(eval(input()))
H=list(map(int,input().split()))
answer="Yes"
for i in range(N):
if i>=1:
if max(H[:i])>H[i]+1:
answer="No"
break
else:
pass
print(answer) | N=int(eval(input()))
H=list(map(int,input().split()))
answer="Yes"
for i in range(1,N,):
if H[N-i]>=H[N-i-1]:
pass
else:
H[N-i-1]-=1
if H[N-i]<H[N-i-1]:
answer="No"
print(answer) | p02953 |
N = int(eval(input()))
H = list(map(int, input().split()))
H.reverse()
for i in range(1, N):
if H[i-1] < H[i] - 1:
print("No")
break
elif H[i-1] == H[i] - 1:
H[i] -= 1
else:
print("Yes") | N = int(eval(input()))
H = list(map(int, input().split()))
for i in range(N - 2, -1, -1):
if H[i] <= H[i+1]:
continue
elif H[i] - 1 == H[i+1]:
H[i] -= 1
else:
print("No")
break
else:
print("Yes") | p02953 |
N = int(eval(input()))
H = list(map(int,input().split()))
f = 0
for i in range(1,N):
if H[-(i+1)] <= H[-i]:
continue
else:
if H[-(i+1)]-H[-i] == 1:
H[-(i+1)] -= 1
else:
f += 1
break
if f == 0:
print("Yes")
else:
print("No") | # Coding by Rute
# C - Build Stairsの解説を始めます。
N = int(eval(input()))
H = list(map(int,input().split()))
f = 0 #フラグ関数です。
for i in range(1,N):
if H[-(i+1)] <= H[-i]:
#階段の高さが単調非減少かを調べます。
continue
else:
if H[-(i+1)]-H[-i] == 1:
#そうでない場合、高さが1小さければ、H[-(i+1)]を1小さくすれば良いです。
#もし高さが2以上小さければ、その時点で単調非減少とすることができないのでフラグ関数に1を加えます。
H[-(i+1)] -= 1
else:
f += 1
break
if f == 0:
print("Yes")
else:
print("No")
#計算量は判定でO(N)かかります。
#以上、C - Build Stairsの解説でした。
| p02953 |
n = int(eval(input()))
h = list(map(int, input().split()))
cur = h[-1]
i = n - 2
flg = True
while i >= 0:
if h[i] <= cur + 1:
cur = min(cur, h[i])
else:
flg = False
break
i -= 1
print(('Yes' if flg else 'No'))
| def main():
N = int(eval(input()))
*H, = list(map(int, input().split()))
cond = True
p = H[0] - 1
for h in H[1:]:
if p < h:
p = h - 1
elif p == h:
pass
else:
cond = False
break
print(('Yes' if cond else 'No'))
if __name__ == '__main__':
main()
| p02953 |
# import sys
# sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
def II(): return int(eval(input()))
def MI(): return list(map(int, input().split()))
def MI1(): return list(map(int1, input().split()))
def LI(): return list(map(int, input().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
from collections import deque
def solve():
n = II()
H = LI()
d = deque([])
flag = True
for i in range(0, n):
hi = H[i]
if i == 0:
d.append(hi - 1)
continue
hp = d.popleft()
if hp < hi:
d.append(hi - 1)
elif hp == hi:
d.append(hi)
else: # hp > hi
flag = False
break
print(('Yes' if flag else 'No'))
if __name__ == '__main__':
solve()
| # import sys
# sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
def II(): return int(eval(input()))
def MI(): return list(map(int, input().split()))
def MI1(): return list(map(int1, input().split()))
def LI(): return list(map(int, input().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def solve():
n = II()
H = LI()
pre = -999
flag = True
for h in H:
if pre <= h - 1:
pre = h - 1
elif pre <= h:
pre = h
else:
flag = False
break
print(('Yes' if flag else 'No'))
if __name__ == '__main__':
solve()
| p02953 |
n = int(eval(input()))
L = list(map(int,input().split()))
if len(L)==1:
flag = "Yes"
for i in range(1,n):
if max(L[:i]) - min(L[i:]) >=2:
flag = "No"
else:
flag = "Yes"
print(flag)
| n = int(eval(input()))
L = list(map(int,input().split()))
for i in range(n,1,-1):
if L[i-1]<L[i-2]:
L[i-2]-=1
if L[i-1]<L[i-2]:
print("No")
exit()
print("Yes") | p02953 |
n = int(eval(input()))
L = list(map(int,input().split()))
for i in range(n,1,-1):
if L[i-1]<L[i-2]:
L[i-2]-=1
if L[i-1]<L[i-2]:
print("No")
exit()
print("Yes") | n = int(eval(input()))
L = list(map(int,input().split()))
for i in range(n-1,0,-1):
if L[i]<L[i-1]:
L[i-1]-=1
if L[i]<L[i-1]:
print("No")
exit()
print("Yes")
| p02953 |
N = int(eval(input()))
H = list(map(int, input().split()))
I = []
for i in range(N - 1):
if H[i] >= H[i + 1]:
I.append(H[i])
I.append(H[N - 1])
N = len(I)
for i in range(N):
for j in range(i + 1, N):
if I[i] > I[j] + 1:
print('No')
quit()
print('Yes') | N = int(eval(input()))
H = list(map(int, input().split()))
I = [H[i + 1] - H[i] for i in range(N - 1)]
N = len(I)
for i in range(N):
if I[i] >= 0:
continue
elif I[i] < -1:
print('No')
quit()
else:
if i == N - 1:
continue
for j in range(i + 1, N):
if I[j] >= 1:
break
elif I[j] <= -1:
print('No')
quit()
else:
continue
print('Yes') | p02953 |
n=int(eval(input()))
hi=[]
for i in map(int,input().split()):
hi.append(i)
YesNo="Yes"
for i in range(n-1,1,-1):
if hi[i]+2<=hi[i-1]:
YesNo="No"
# print("No")
break
elif hi[i]+1==hi[i-1]:
hi[i-1]=hi[i-1]-1
print(YesNo) |
n=int(eval(input()))
h=list(map(int,input().split()))
yn=""
for i in range(n-2,-1,-1):
if h[i]<=h[i+1]:
continue
elif h[i]==h[i+1]+1:
h[i]-=1
continue
else:
yn="No"
break
if yn=="No":
print("No")
else:
print("Yes")
| p02953 |
import bisect,collections,copy,heapq,itertools,math,operator,string
def I(): return int(eval(input()))
def S(): return eval(input())
def LI(): return list(map(int,input().split()))
def LS(): return list(input().split())
##################################################
N = I()
H = LI()
if N==1:
print('Yes')
exit()
if N==2:
print(('Yes' if H[0]-1<=H[1] else 'No'))
exit()
for i in range(N-1):
if i==0:
H[i] -= 1
continue
if H[i-1]<=H[i]-1<=H[i+1]:
H[i] -= 1
continue
if H[i-1]<=H[i]<=H[i+1]:
continue
print('No')
break
else:
print('Yes')
| def I(): return int(eval(input()))
def LI(): return list(map(int,input().split()))
##################################################
N = I()
H = LI()
for i in range(N):
if i==0:
H[i] -= 1
continue
if i==N-1:
if H[i-1]<=H[i]:
continue
if H[i-1]<=H[i]-1<=H[i+1]:
H[i] -= 1
continue
if H[i-1]<=H[i]<=H[i+1]:
continue
print('No')
break
else:
print('Yes')
| p02953 |
N = int(eval(input()))
H = list(map(int, input().split()))
# print(N, H)
ret = 'Yes'
for i in range(N):
for j in range(i, N):
if H[i]-1 > H[j]:
ret = 'No'
break
if ret == 'No':
break
print(ret)
| N = int(eval(input()))
H = list(map(int, input().split()))
ret = 'Yes'
bar = H[0] - 1
for i in range(1, N):
if bar > H[i]:
ret = ('No')
break
elif bar < H[i]:
bar = H[i] - 1
print(ret)
| p02953 |
N = int(eval(input()))
H = list(map(int, input().split()))
for i in range(N-2, 0, -1):
if H[i] > H[i+1]+1:
print("No")
exit()
elif H[i] == H[i+1]+1:
H[i] -= 1
print("Yes")
| N = int(eval(input()))
H = list(map(int, input().split()))
prev = -1
flag = True
for x in H:
if x < prev:
flag = False
break
if x == prev:
continue
prev = x - 1
print(("Yes" if flag else "No")) | p02953 |
n = int(eval(input()))
tall = list(map(int, input().split()))
maxhigh = [i for i, x in enumerate(tall) if x == max(tall)]
minhigh = [i for i, x in enumerate(tall) if x == min(tall)]
if(n == 1):
print("Yes")
elif((max(tall) - min(tall)>= 2)and(min(maxhigh)>max(minhigh))):
print("Yes")
else:
print("No")
| n = int(eval(input()))
tall = list(map(int, input().split()))
lar = tall[0]
lno = 0
frag = 0
for i in range(n):
if(tall[i]>lar):
lar= tall[i]
if(lar - tall[i] >= 2):
frag = 1
break
if(frag == 1):
print("No")
else:
print("Yes") | p02953 |
#!usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS():return [list(x) for x in sys.stdin.readline().split()]
def S():
res = list(sys.stdin.readline())
if res[-1] == "\n":
return res[:-1]
return res
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)]
sys.setrecursionlimit(1000000)
mod = 1000000007
#A
def A():
a,b,c = LI()
c -= a-b
print((max(0,c)))
return
#B
def B():
n = I()
ans = 0
for i in range(1,n+1):
s = str(i)
if len(s)%2:
ans += 1
print(ans)
return
#C
def C():
n = I()
h = LI()
h[0] -= 1
for i in range(n-1):
if h[i+1] < h[i]:
print("No")
return
if h[i+1] > h[i]:
h[i+1] -= 1
print("Yes")
return
#D
def D():
return
#E
def E():
return
#F
def F():
return
#Solve
if __name__ == "__main__":
C()
| #!usr/bin/env python3
from collections import defaultdict, deque
from heapq import heappush, heappop
from itertools import permutations, accumulate
import sys
import math
import bisect
def LI(): return [int(x) for x in sys.stdin.buffer.readline().split()]
def I(): return int(sys.stdin.buffer.readline())
def LS():return [list(x) for x in sys.stdin.readline().split()]
def S():
res = list(sys.stdin.readline())
if res[-1] == "\n":
return res[:-1]
return res
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)]
sys.setrecursionlimit(1000000)
mod = 1000000007
def solve():
n = I()
h = LI()
m = h[0]-1
for i in h[1:]:
if m > i:
print("No")
return
m = max(m,i-1)
print("Yes")
return
#Solve
if __name__ == "__main__":
solve()
| p02953 |
N = int(eval(input()))
H = list(map(int, input().split()))
for i in range(1,N):
diff = H[i] - H[i-1]
if diff > 0:
H[i] -= 1
if diff < 0:
print('No')
exit()
print('Yes') | N = int(eval(input()))
H = list(map(int, input().split()))
pre = None
for i in H[::-1]:
if pre == None:
pre = i
continue
elif i < pre:
pre = i
continue
elif i <= pre+1:
continue
print('No')
exit()
print('Yes') | p02953 |
N=int(eval(input()))
H=list(map(int,input().split()))[::-1]
flag=True
base=H[0]
for i in range(N-1):
if H[i]+1==H[i+1]:
H[i+1]-=1
elif H[i]>=H[i+1]:
continue
else:
flag=False
print(("Yes" if flag else "No")) | N=int(eval(input()))
H=list(map(int,input().split()))
base=0
for h in H:
if base>h:
print("No")
break
base=max(base,h-1)
else:
print("Yes") | p02953 |
n = int(eval(input()))
h = list(map(int, input().split()))
ans = True
for i in range(len(h)-1):
if h[i] > (min(h[i+1:]) + 1):
ans = False
if ans:
print('Yes')
else:
print('No') | n = int(eval(input()))
h = list(map(int, input().split()))
ans = True
m = h[0]
for i in range(1, len(h)):
if h[i] + 1 < m:
ans = False
m = max(m, h[i])
if ans:
print('Yes')
else:
print('No') | p02953 |
n = int(eval(input()))
h = list(map(int,input().split()))
M = h[0]
for i in range(n-1):
if h[i] >= h[i+1] + 2:
print("No")
exit()
if M > h[i+1] + 1:
print("No")
exit()
M = max(M,h[i+1])
print("Yes") | n = int(eval(input()))
h = list(map(int,input().split()))
M = h[0]
for i in range(n-1):
if M > h[i+1] + 1:
print("No")
exit()
M = max(M,h[i+1])
print("Yes") | p02953 |
N = int(eval(input()))
H = [int(x) for x in input().split()]
# print(N,H)
result = "Yes"
for i in range(len(H)-1):
if (H[i]-1 > min(H[i+1:])):
result = "No"
break
print(result) | N = int(eval(input()))
H = [int(x) for x in input().split()]
# print(N,H)
result = "Yes"
top = 0
for i in range(len(H)):
if (H[i] < top-1 ):
result = "No"
break
top = max(top, H[i])
print(result) | p02953 |
N = int(eval(input()))
H = [int(h) for h in input().split()]
for i in reversed(list(range(1, N))):
if H[i] >= H[i-1]: continue
elif H[i] == H[i-1] - 1: H[i-1] -= 1
else:
print("No")
break
else: print("Yes")
| import sys
def solve():
input = sys.stdin.readline
N = int(eval(input()))
H = [int(h) for h in input().split()]
for i in reversed(list(range(N-1))):
if H[i] > H[i + 1]: H[i] -= 1
if H[i] > H[i + 1]:
print("No")
break
else: print("Yes")
return 0
if __name__ == "__main__":
solve() | p02953 |
N = int(eval(input()))
H = list(map(int, input().split()))
flag = True
for i in range(N):
if H[i]-1 > min(H[i:N]):
flag = False
break
if flag:
print("Yes")
else:
print("No") | N = int(eval(input()))
H = list(map(int, input().split()))
flag = True
for i in range(N-1, 0, -1):
if H[i-1] - 1 == H[i]:
H[i-1] -= 1
elif H[i-1] - 1 > H[i]:
flag = False
break
if flag:
print("Yes")
else:
print("No") | p02953 |
N = int(eval(input()))
H = list(map(int, input().split()))
res = True
if N >= 2:
for i in range(N - 1):
for j in range(1, N - i):
if H[i] - H[i + j] >= 2:
res = False
break
if res == False:
break
if res == True:
print('Yes')
else:
print('No') | N = int(eval(input()))
H = list(map(int, input().split()))
res = True
if N >= 2:
for i in range(N - 1):
if H[i] - H[i + 1] >= 2:
res = False
y_card = 0
if N >= 3 and res == True:
for i in range(N - 1):
if H[i] - H[i + 1] == 1:
y_card += 1
if y_card == 2:
res = False
break
elif H[i] == H[i + 1]:
pass
elif H[i + 1] - H[i] >= 1:
y_card -= H[i + 1] - H[i]
if y_card < 0:
y_card = 0
if res == True:
print('Yes')
else:
print('No')
| p02953 |
n=int(eval(input()))
h=list(map(int,input().split()))
temp=0
if n==1:
print("Yes")
else:
for i in range(0,n-1):
tempmax=min(h[i+1:])
if h[i]-1>tempmax:
temp=1
break
if temp==0:
print("Yes")
else:
print("No") | N=int(eval(input()))
H=list(map(int,input().split()))
base=0
for h in H:
if base>h:
print("No")
break
base=max(base,h-1)
else:
print("Yes") | p02953 |
N = int(eval(input()))
H = [int (i) for i in input().split()]
flag = 1
if N == 1:
flag = 1
else:
for i in range(N-2,-1,-1):
if H[i] > H[i+1]:
H[i] -= 1
for i in range(N-1):
if H[i] > H[i+1]:
flag = 0
if flag == 0:
print("No")
else:
print("Yes")
| N = int(eval(input()))
H = [int (i) for i in input().split()]
flag = 1
if N == 1:
flag = 1
else:
for i in range(1,N):
if H[i-1] > H[i]:
H[i] += 1
for i in range(N-1):
if H[i] > H[i+1]:
flag = 0
if flag == 0:
print("No")
else:
print("Yes")
| p02953 |
N = int(eval(input()))
A = [0]*(N)
H = list(map(int, input().split()))
ans = "Yes"
hmax = max(H)
k = H.index(hmax)
Hd = [0]*k
for i in range(k):
Hd[i]=H[i]
if H[i]<max(Hd)-1:
ans = "No"
for i in range(k,N,1):
if H[i]<hmax-1:
ans = "No"
print(ans)
| N = int(eval(input()))
A = [0]*(N)
H = list(map(int, input().split()))
ans = "Yes"
hmax = max(H)
k = H.index(hmax)
Hd = [0]*k
Hdmax=int(0)
for i in range(k):
Hd[i] = H[i]
Hdmax = max(Hdmax,Hd[i])
if H[i] < Hdmax - 1:
ans = "No"
for i in range(k,N,1):
if H[i]<hmax-1:
ans = "No"
print(ans)
| p02953 |
N = int(eval(input()))
H = list(map(int,input().split()))
hmax = H[0]
flag = 0
for i in range(1,N):
hmax = max(hmax,H[i])
if hmax-H[i]>=2:
flag = 1
break
if flag==0:
print("Yes")
else:
print("No") | N = int(eval(input()))
H = list(map(int,input().split()))
hmax = H[0]
flag = 0
for i in range(1,N):
if H[i]>=hmax:
hmax = H[i]
else:
if hmax-H[i]>=2:
flag = 1
break
if flag==1:
print("No")
else:
print("Yes") | p02953 |
N = int(eval(input()))
H = list(map(int,input().split()))
hmax = H[0]
flag = 0
for i in range(1,N):
if H[i]>=hmax:
hmax = H[i]
else:
if hmax-H[i]>=2:
flag = 1
break
if flag==1:
print("No")
else:
print("Yes") | N = int(eval(input()))
H = list(map(int,input().split()))
flag = 0
hmax = H[0]
for i in range(N):
if H[i]<hmax-1:
flag = 1
break
hmax = max(hmax,H[i])
if flag==1:
print("No")
else:
print("Yes") | p02953 |
N = int(eval(input()))
X = list(map(int,input().split()))
for i in range(1,N):
if max(X[:i])-min(X[i:]) > 1:
print("No")
exit()
print("Yes") | N = int(eval(input()))
X = list(map(int,input().split()))
maxlst = []
minlst = []
R = 10**10
L = 0
for i in range(N):
L = max(X[i],L)
maxlst.append(L)
R = min(X[-i-1],R)
minlst.append(R)
minlst.reverse()
for i in range(N-1):
if maxlst[i]-minlst[i+1] > 1:
print("No")
exit()
print("Yes") | p02953 |
N = int(eval(input()))
H = list(map(int, input().split()))
for i in range(N-1):
if H[i] > H[i+1]:
H[i] -= 1
elif H[i] == H[i+1]:
if H[i]-1 >= H[i-1]:
H[i] -= 1
for i in range(N-1):
if H[i] > H[i+1]:
print('No')
exit()
print('Yes')
| N = int(eval(input()))
H = list(map(int, input().split()))
H[0] -= 1
for i in range(1, N):
if H[i-1] <= H[i] - 1:
H[i] -= 1
if not H[i-1] <= H[i]:
print('No')
exit()
print('Yes') | p02953 |
N = int(eval(input()))
H = list(map(int,input().split()))
ans = "Yes"
RMH = [0]*N
# 右端から右からi番目の要素のうち最小の値
for i in range(N):
if i == 0:
RMH[i] = H[-i-1]
else:
RMH[i] = min([RMH[i-1],H[-i-1]]) #reversed
# 左からi番目の要素が、左からi+1番目から右端の要素の最小値との差が常に１以下ならOK
for i in range(N-1):
if H[i] - RMH[-i-2] > 1:
ans = "No"
print(ans) | N = int(eval(input()))
H = list(map(int, input().split()))
H.reverse()
def main():
for i in range(N-1):
if (H[i+1] - H[i] >= 2):
print("No")
return
if (H[i+1] - H[i] == 1):
H[i+1] -= 1
print("Yes")
main() | p02953 |
n = int(eval(input()))
listH = list(map(int, input().split()))
for i in range(0, n-1):
if(listH[i+1] - listH[i] == -1):
listH[i+1] += 1
if(listH[i+1] - listH[i] < -1):
print("No")
quit()
print("Yes") | n = int(eval(input()))
h = list(map(int, input().split()))
for i in range(n-1):
if h[i+1] - h[i] == -1:
h[i+1] += 1
elif h[i+1] - h[i] < -1:
print("No")
quit()
print("Yes") | p02953 |
def move_mass(h_list, h_moved_flag):
for index in range(0,n-1):
if h_list[index] > h_list[index+1] and h_moved_flag[index] is False:
h_list[index] = h_list[index]-1
h_moved_flag[index] = True
return h_list, h_moved_flag
################################
n = int(eval(input()))
if n == 1:
print("Yes")
exit()
h_list = [int(h) for h in input().split()]
h_moved_flag = [False for i in range(n)]
for index in range(1000):
h_list, h_moved_flag = move_mass(h_list, h_moved_flag)
not_dec_flag = False
for index in range(0,n-1):
if h_list[index] > h_list[index+1]:
not_dec_flag = True
if not_dec_flag == False:
print("Yes")
exit()
print("No") | from heapq import heappop, heappush
import sys
input = sys.stdin.readline
N = int(eval(input()))
H = list(map(int,input().split()))
for i in range(1,N):
dif = H[i] - H[i-1]
if dif >= 0: continue
elif dif == -1: H[i] += 1
else:
print('No')
exit()
print('Yes') | p02953 |
n = int(eval(input()))
l = [int(x) for x in input().split()]
#print(l)
for i in range(n-1)[::-1]:
if l[i] - 1 == l[i+1]:
l[i] = l[i] - 1
else:
continue
#print(l)
a = 0
for j in range(1, n):
if l[j-1] <= l[j]:
continue
else:
print('No')
break
else:
print('Yes')
| # アルゴリズムを思いつけなかった！
n = int(eval(input()))
l = [int(x) for x in input().split()]
for i in range(n-1)[::-1]: #右からループ
if l[i] - 1 == l[i+1]:# 右より1大きい場合にのみ
l[i] = l[i] - 1 # 1引く
else:
continue
a = 0
for j in range(1, n):
if l[j-1] <= l[j]:
continue
else:
print('No')
break
else: # forをbreakすることなく完了した場合に稼働
print('Yes')
| p02953 |
import sys
n = int(eval(input()))
li = list(map(int,input().split()))
n_str = str(n)
li_size = len(li)
for i in range(li_size):
li_contents = li[i] - 1
for j in range(li_size - i):
if li_contents > li[j + i]:
print("No")
sys.exit()
print("Yes")
| import sys
n = int(eval(input()))
li = list(map(int,input().split()))
n_str = str(n)
li_size = len(li)
max = li[0]
for i in range(li_size):
if max == li[i]:
continue
elif max > li[i]:
print("No")
sys.exit()
elif max < li[i]:
max = li[i] - 1
print("Yes") | p02953 |
n=int(eval(input()))
il=list(map(int, input().split()))
yn="Yes"
l=len(il)
for i in range(1, l):
if i == 0:
continue
for j in range(0,i-1):
if il[j] > il[i] + 1:
yn = "No"
break
print(yn) | n=int(eval(input()))
il=list(map(int, input().split()))
m=il[0]
yn="Yes"
for a in il[1:]:
if m - 1 <= a:
m=max([m, a])
continue
yn="No"
break
print(yn) | p02953 |
N = int(eval(input()))
*H, = list(map(int, input().split()))
m = 0
for i,j in enumerate(H):
if i==0:
m = j
if m-j>1:
print("No")
break
m = max(m, j)
else:
print("Yes")
| N = int(eval(input()))
*H, = list(map(int, input().split()))
m = H[0]
for i in H:
if m-i>1:
print("No")
break
m = max(m, i)
else:
print("Yes") | p02953 |
N = int(eval(input()))
H = list(map(int,input().split()))
check = True
for i in range(0,N-1):
if H[i] - min(H[i+1:]) >= 2:
check = False
if check:
print("Yes")
else:
print("No") | N = int(eval(input()))
H = list(map(int,input().split()))
H.reverse()
check = True
for i in range(N-1):
if H[i] >= H[i+1]:
continue
else:
if H[i+1] - H[i] > 1:
check = False
break
else:
H[i+1] -= 1
if check:
print("Yes")
else:
print("No") | p02953 |
n=int(eval(input()));sa=[0]*n
h=list(map(int,input().split()))
for i in range(n):
for j in range(n):
try:
if h[j]>h[j+1] and sa[j]!=1:
h[j]=h[j]-1
sa[j]=1
except IndexError:
pass
for i in range(n):
try:
if h[i]>h[i+1]:
print("No")
exit()
except IndexError:
pass
print("Yes") | n=int(eval(input()))
h=list(map(int,input().split()))
h[0]=h[0]-1
for i in range(1,n):
try:
if h[i-1]<=h[i]-1:
h[i]=h[i]-1
except IndexError:
pass
for i in range(n):
try:
if h[i]>h[i+1]:
print("No")
exit()
except IndexError:
pass
print("Yes") | p02953 |
import heapq
n = int(eval(input()))
h = list(map(int, input().split()))
for i in range(1, n):
h_minus = list([x*(-1) for x in h[:i]])
heapq.heapify(h_minus)
if h[i] < (h_minus[0])*(-1)-1:
print("No")
exit(0)
print("Yes") | n = int(eval(input()))
h = list(map(int, input().split()))
h_max = h[0]
for i in range(1, n):
if h[i-1] > h_max:
h_max = h[i-1]
if h[i] < h_max -1:
print("No")
exit(0)
print("Yes") | p02953 |
import sys
n = int(eval(input()))
h = list(map(int, input().split()))
max_ = h[0]
for i in range(1, n - 1):
max_ = max(max_, h[i])
if max_ - h[i + 1] >= 2:
print("No")
sys.exit()
print("Yes") | n = int(eval(input()))
h = list(map(int, input().split()))
max_ = h[0]
for i in range(1, n - 1):
max_ = max(max_, h[i])
if max_ - h[i + 1] >= 2:
print("No")
exit()
print("Yes") | p02953 |
n=int(eval(input()))
H=[int(i) for i in input().split()]
for i in range(n):
if i!=0:
H=H[:-1]
if max(H)-H[-1]>1:
print("No")
exit(0)
print("Yes") | n=int(eval(input()))
H=[int(i) for i in input().split()]
for i in range(n-1,0,-1):
if H[i]<H[i-1]:
H[i-1]-=1
if H[i]<H[i-1]:
print("No")
exit()
print("Yes") | p02953 |
N = int(eval(input()))
H = list(map(int, input().split()))
prev = float('inf')
for h in H[::-1]:
if h - prev > 1:
print('No')
break
prev = h - (h > prev)
else:
print('Yes')
| N = int(eval(input()))
H = list(map(int, input().split()))
m = H[0]
for h in H[1:]:
if m - h > 1:
print('No')
break
m = max(m, h)
else:
print('Yes')
| p02953 |
N = int(eval(input()))
H = list(map(int, input().split()))
count = 0
max_i = 0
H.append(10**9 + 2)
for i in range(N):
if H[i] > H[i + 1] + 1:
count += 1
if max_i - H[i] > 1:
count += 1
max_i = max(H[:i+1])
if count == 0:
print("Yes")
else:
print("No") | N = int(eval(input()))
H = list(map(int, input().split()))
count = 0
max_i = 0
H.append(10**9 + 2)
for i in range(N):
if H[i] > H[i + 1] + 1:
count += 1
if max_i - H[i] > 1:
count += 1
max_i = max(max_i,H[i])
if count == 0:
print("Yes")
else:
print("No") | p02953 |
def main():
import sys
input = sys.stdin.readline
n = int(input().rstrip('\n'))
h = list(map(int, input().rstrip('\n').split()))
h[0] -= 1
for i in range(1, n):
if h[i] > h[i-1]:
h[i] -= 1
if h[i] < h[i-1]:
print("No")
exit()
print("Yes")
if __name__ == '__main__':
main()
| def slove():
import sys
input = sys.stdin.readline
n = int(input().rstrip('\n'))
h = list(map(int, input().rstrip('\n').split()))
for i in range(1, n):
if h[i] < h[i-1]:
h[i] += 1
if h[i] < h[i-1]:
print("No")
exit()
print("Yes")
if __name__ == '__main__':
slove()
| p02953 |
from itertools import chain, combinations
import copy
n = int(eval(input()))
a = list(map(int, input().split()))
def powerset(iterable):
s = list(iterable)
return chain.from_iterable(combinations(s, r) for r in range(len(s) + 1))
def is_mono(a):
if len(a) < 2:
return True
for i in range(len(a) - 1):
if a[i + 1] < a[i]:
return False
return True
def can_mono(a):
for i in range(len(a) - 2):
if a[i + 1] < a[i] and a[i + 2] < a[i + 1]:
return False
for m in powerset(list(range(len(a)))):
b = copy.deepcopy(a)
for i in m:
b[i] -= 1
if is_mono(b):
return True
return False
if can_mono(a):
result = 'Yes'
else:
result = 'No'
print(("{}".format(result))) | n = int(eval(input()))
a = list(map(int, input().split()))
def can_mono(a):
len_a = len(a)
for i in range(len_a - 2):
if a[i + 1] < a[i] - 1:
return False
if a[i + 1] < a[i]:
for j in range(i + 1, len_a - 1):
if a[j + 1] < a[i + 1]:
return False
if a[j + 1] > a[i + 1]:
break
if a[j + 1] == a[i + 1]:
continue
return True
if can_mono(a):
result = 'Yes'
else:
result = 'No'
print(("{}".format(result))) | p02953 |
N = int(eval(input()))
H = list(map(int,input().split()))
minh = H[0]-1
for h in H[1:]:
if minh > h:
print('No')
exit()
minh = max(minh, h-1)
print('Yes') | N = int(eval(input()))
H = list(map(int,input().split()))
down = False
p = -1
for h in H:
if p - h >= 2:
print('No')
exit()
if down and p - h >= 1:
print('No')
exit()
if p < h:
down = False
elif p > h:
down = True
p = h
print('Yes') | p02953 |
N = int(eval(input()))
H = list(map(int, input().split()))
for i in range(1, N):
if H[i] < max(H[:i]) - 1:
print("No")
exit()
print("Yes")
| N = int(eval(input()))
H = list(map(int, input().split()))
M = 0
for i in range(1, N):
M = max(M, H[i - 1])
if H[i] < M - 1:
print("No")
exit()
print("Yes")
| p02953 |
n = int(eval(input()))
h = list(map(int,input().split()))
flag = False
length = len(h)
if length == 1:
flag = True
for i in reversed(list(range(1,length))):
if h[i] < h[i-1]:
h[i-1] = h[i-1] - 1
if h[i] != h[i-1]:
break
if i == 1:
flag = True
if flag:
print('Yes')
else:
print('No') | import sys
n = int(eval(input()))
h = list(map(int,input().split()))
h = h[::-1]
for i in range(n-1):
if h[i] < h[i+1]:
h[i+1] -= 1
if h[i] < h[i+1]:
print('No')
sys.exit()
print('Yes')
| p02953 |
import sys
sys.setrecursionlimit(20000000)
input = sys.stdin.readline
def main():
n = int(eval(input()))
nums = list(map(int, input().split()))
for x in reversed(list(range(1, len(nums)))):
if nums[x-1] > nums[x]:
nums[x-1] -= 1
if nums[x-1] > nums[x]:
print('No')
sys.exit()
print('Yes')
if __name__ == '__main__':
main() | import sys
input = sys.stdin.readline
n = int(eval(input()))
nums = list(map(int, input().split()))
maxnum = 0
for x in nums:
if maxnum < x:
maxnum = x
if maxnum - x > 1:
print('No')
sys.exit()
print('Yes')
| p02953 |
n = int(eval(input()))
H = list(map(int, input().split()))
H[0] -= 1
for i in range(1, n):
if H[i-1] < H[i]:
H[i] -= 1
if all(H[i-1] <= H[i] for i in range(1, n)):
print('Yes')
else:
print('No') | n = int(eval(input()))
H = list(map(int, input().split()))
H[0] -= 1
for i in range(1, n):
if H[i-1] < H[i]:
H[i] -= 1
print(('Yes' if all(h0 <= h1 for h0, h1 in zip(H, H[1:])) else 'No')) | p02953 |
n = int(eval(input()))
h = [int(i) for i in input().split()] # input:"1 2 3 4 5"
ans = 0
for i in range(n-1):
for j in range(i,n-1):
delta = h[j]-h[i]
if h[j+1]+1<h[i]:
ans = 1
break
elif h[j+1]+1==h[i]:
h[i]-=1
break
if ans == 1:
print('No')
elif sorted(h)==h:
print('Yes')
else:
print('No')
| n = int(eval(input()))
h = [int(i) for i in input().split()] # input:"1 2 3 4 5"
#2019/08/08とき直し
#次のマスの高さを１高くすることができるようにする
ans = 'Yes'
for i in range(n-1):
if h[i]>h[i+1]+1:
ans = 'No'
break
elif h[i]==h[i+1]+1:
h[i+1]+=1
print(ans) | p02953 |
def resolve():
n = int(eval(input()))
h = list(map(int, input().split()))
flag = 0
for i in range(n-1):
if h[i] == h[i+1]:
continue
else:
h[i+1] -= 1
if h[i] <= h[i+1]:
continue
else:
print("No")
exit()
print("Yes")
resolve() | def resolve():
n = int(eval(input()))
h = list(map(int, input().split()))
OK = True
for i in range(1, len(h)):
if h[i] == h[i-1]:
continue
elif h[i] > h[i-1]:
h[i] -= 1
else:
OK = False
break
if OK:
print("Yes")
else:
print("No")
resolve() | p02953 |
def main():
H = list(map(int, open(0).read().split()[:1:-1]))
pre = None
for h in H:
if pre is None:
pre = h
if pre + 1 < h:
print("No")
return
if pre + 1 == h:
pre = h - 1
else:
pre = h
print("Yes")
return
main()
| def main():
H = list(map(int, open(0).read().split()[:1:-1]))
pre = None
for h in H:
if pre is None:
pre = h
elif h <= pre:
pre = h
elif pre + 1 == h:
continue
else:
# pre + 1 < h
print("No")
return
print("Yes")
return
main()
| p02953 |
def main():
H = list(map(int, open(0).read().split()[:1:-1]))
pre = None
for h in H:
if pre is None:
pre = h
elif h <= pre:
pre = h
elif pre + 1 == h:
continue
else:
# pre + 1 < h
print("No")
return
print("Yes")
return
main()
| def main():
H = list(map(int, open(0).read().split()[:0:-1]))
pre = None
for h in H:
if pre is None:
pre = h
elif h <= pre:
pre = h
elif pre + 1 == h:
continue
else:
# pre + 1 < h
print("No")
return
print("Yes")
return
main()
| p02953 |
N = int(eval(input()))
h = list(map(int, input().split()))[::-1]
f = [0] * N
ans = 'Yes'
last = 10 ** 10
for hi in h:
if last >= hi:
last = hi
elif last >= hi - 1:
last = hi - 1
else:
ans = 'No'
print(ans)
| N = int(eval(input()))
H = list(map(int, input().split()))[::-1]
last = 10 ** 10
ans = 'Yes'
for hi in H:
if last >= hi:
last = hi
elif last >= hi - 1:
last = hi - 1
else:
ans = 'No'
print(ans)
| p02953 |
n = int(eval(input()))
h = list(map(int, input().split()))
isYes = True
for i in range(n-1):
if h[i] - min(h[i+1:]) >= 2:
isYes = False
break
if isYes:
print('Yes')
else:
print('No') | n = int(eval(input()))
h = list(map(int, input().split()))
isYes = True
tmpmin = 10**9+1
for i in range(1, n):
if h[n-i] <= tmpmin:
tmpmin = h[n-i]
if h[n-(i+1)]-h[n-i]>= 2 or h[n-(i+1)]-tmpmin >= 2:
isYes = False
break
if isYes:
print('Yes')
else:
print('No') | p02953 |
import sys
n = int(eval(input()))
l = list(map(int, (input().split())))
for i in range(n):
if len([ a for a in l if l[0] -1 > a]) > 0:
print('No')
sys.exit()
else:
l = l[1::]
print('Yes')
| import sys
n = int(eval(input()))
l = list(map(int, (input().split())))
max = l[0]
for i in range(n):
if max - 1 > l[i]:
print('No')
sys.exit()
elif l[i] > max:
max = l[i]
print('Yes')
| p02953 |
n = int(eval(input()))
h = list(map(int, input().split()))
up = 0
flag = 1
for i in range(n-1):
ma = h[i]+up
if ma<=h[i+1]:
up = 0
elif ma<=h[i+1]+1:
up = 1
else:
flag = 0
break
if flag:
print("Yes")
else:
print("No") | N = int(eval(input()))
H = list(map(int, input().split()))
if N == 1:
print("Yes")
else:
f = 1
for i in range(1, N-1):
if H[-i-1] <= H[-i]:
continue
elif H[-i-1]-1 == H[-i]:
H[-i-1] -= 1
else:
f = 0
break
if f:
print("Yes")
else:
print("No")
| p02953 |
n = int(eval(input()))
h = list(map(int, input().split()))
reverse_h = list(reversed(h))
for i in range(n-1):
if reverse_h[i] < reverse_h[i+1]:
reverse_h[i+1] -= 1
if reverse_h[i] < reverse_h[i+1]:
print("No")
exit()
else:
print("Yes") | n = int(eval(input()))
h = list(map(int, input().split()))
for i in range(n-1):
if h[i] == h[i+1]:
pass
elif h[i] <= h[i+1]-1:
h[i+1] -= 1
else:
print("No")
exit()
print("Yes") | p02953 |
n = int(eval(input()))
h = list(map(int, input().split()))
a = 0
for i in range(n-1):
for j in h[i+1:]:
if h[i]-j >= 2:
print('No')
exit()
print('Yes')
| n = int(eval(input()))
h = list(map(int, input().split()))
c = 0
for i in range(n-1):
if h[i] <= h[i+1]-1:
h[i+1] = h[i+1]-1
elif h[i] == h[i+1]:
continue
else:
c = 1
if c == 1:
print('No')
else:
print('Yes') | p02953 |
n=int(eval(input()))
h=list(map(int,input().split()))
h=h[::-1]
count=0
for i in range(1,n):
if h[i]==h[i-1]+1:
h[i]+=-1
count=1
elif h[i]<=h[i-1]:
count=1
elif h[i]>=h[i-1]+2:
count=0
break
print(('Yes' if count==1 or n==1 else 'No')) | n = int(eval(input()))
h = list(map(int, input().split()))
h = h[::-1]
count = 0
for i in range(1, n):
if h[i]-h[i-1]==1:
h[i]+=-1
elif h[i]-h[i-1]>=2:
print('No')
exit()
print('Yes') | p02953 |
n = int(eval(input()))
h = list(map(int,input().split()))
a = 0
b = 0
x = [0]*n
def sakana(p, q):
for i in range(n-1):
if p[i]>p[i+1] and q[i]==0:
p[i]=p[i]-1
q[i]=1
if n==1:
print("Yes")
else:
while b<100000:
sakana(h, x)
b = b+1
for j in range(n-1):
if h[j]>h[j+1]:
print("No")
break
a = a+1
if a==n-1:
print("Yes") | n = int(eval(input()))
h = list(map(int,input().split()))
a = 0
b = 0
x = [0]*n
if n==1:
print("Yes")
else:
for i in range(n-1):
if h[i]>h[i+1]:
h[i]=h[i]-1
x[i]=1
for k in range(n-1):
if h[n-k-1]<h[n-k-2] and x[n-k-2]==0:
h[n-k-2]=h[n-k-2]-1
for j in range(n-1):
if h[j]>h[j+1]:
print("No")
break
a = a+1
if a==n-1:
print("Yes")
| p02953 |
N = int(eval(input()))
H = list(map(int,input().split()))
for i in range(N-1, 1, -1):
if H[i] >= H[i-1]:
continue
if H[i] < H[i-1]:
if H[i - 1] - 1 == H[i]:
H[i - 1] -= 1
else:
print("No")
exit()
print("Yes") | import sys
stdin = sys.stdin
ns = lambda : stdin.readline().rstrip()
ni = lambda : int(ns())
na = lambda : list(map(int, stdin.readline().split()))
def main():
n = ni()
a = na()
for i in range(n - 1, 1, -1):
if a[i] > a[i - 1]:
continue
if a[i] < a[i - 1]:
if a[i] == a[i - 1] - 1:
a[i - 1] -= 1
continue
if a[i] == a[i - 1]:
continue
print("No")
return
print("Yes")
main() | p02953 |
n = int(eval(input()))
l = list(map(int, input().split()))
if n == 1:
print("Yes")
else:
l1 = l[1:]+[0]
d = [i-j for (i,j) in zip(l1, l)][:-1]
t = [i for i in d if i <= -2]
if len(t) >= 1:
print("No")
else:
if -1 not in d:
print("Yes")
else:
num = d.count(-1)
p = d.index(-1)
if num == 1:
print("Yes")
else:
d = d[p+1:]
for i in range(num-1):
p = d.index(-1)
d1 = d[:p]
if sum(d1) <= 0:
pass
else:
d = d[p+1:]
if len(d) == 0 or -1 not in d:
print("Yes")
else:
print("No") | n = int(eval(input()))
l = list(map(int, input().split()))
if n == 1:
print("Yes")
else:
l1 = l[1:]+[0]
d = [i-j for (i,j) in zip(l1, l)][:-1]
t = [i for i in d if i <= -2]
if len(t) >= 1:
print("No")
else:
if -1 not in d or d.count(-1)==1:
print("Yes")
else:
p = d.index(-1)
d = d[p+1:]
s = ''.join(map(str, d))
spl = s.split("-1")
if "" in spl[:-1]:
print("No")
else:
if spl[-1] == "":
spl = [s for s in spl if s != '']
y = [int(i) for i in spl]
if 0 not in y:
print("Yes")
else:
print("No")
else:
y = [int(i) for i in spl]
if 0 in y[:-1]:
print("No")
else:
print("Yes") | p02953 |
n=int(eval(input()))
h=list(map(int,input().split()))
if n>1:
for i in range(n-1):
for j in range(i+i,n):
if h[i]-h[j]>1:
print("No")
break
else:
continue
break
else:print("Yes")
else:
print("Yes") | n=int(eval(input()))
h=list(map(int,input().split()))
max=h[0]
flag=0
for i in h:
if i>=max:
max=i
elif max-i>=2:
flag=1
break
if flag==0:
print("Yes")
else:
print("No") | p02953 |
# -*- coding: utf-8 -*-
# 1つ目の入力
num = int(eval(input()))
# スペース区切りの整数の入力
num_list = list(map(int,input().split()))
def judge(num_list, num):
if num == 1:
return('Yes')
for i in range(0,len(num_list)-1):
for j in range(i+1,len(num_list)):
if num_list[i] -1 <= num_list[j]:
if i+1 == num-1:
return('Yes')
else:
return('No')
print((judge(num_list, num))) | # -*- coding: utf-8 -*-
# 1つ目の入力
num = int(eval(input()))
# スペース区切りの整数の入力
num_list = list(map(int,input().split()))
def judge(num_list, num):
if num == 1:
return('Yes')
decrease = False
for i in range(0,len(num_list)):
if i + 1 == num: # 終わりなので、何もしない
return('Yes') # 最後までOKだったので、Yesをリターン
if num_list[i] == num_list[i+1]:
pass
elif num_list[i] < num_list[i+1]:
decrease = False
elif num_list[i] - 1 <= num_list[i+1]:
if decrease:
return('No')
else:
decrease = True
else:
return('No')
'''
for j in range(i+1,len(num_list)):
if num_list[i] -1 <= num_list[j]:
if i+1 == num-1:
return('Yes')
else:
return('No')
'''
print((judge(num_list, num))) | p02953 |
def s0():return eval(input())
def s1():return input().split()
def s2(n):return [eval(input()) for x in range(n)]
def s3(n):return [input().split() for _ in range(n)]
def s4(n): return [[x for x in s] for s in s2(n)]
def n0():return int(eval(input()))
def n1():return [int(x) for x in input().split()]
def n2(n):return [int(eval(input())) for _ in range(n)]
def n3(n):return [[int(x) for x in input().split()] for _ in range(n)]
def t3(n):return [tuple(int(x) for x in input().split()) for _ in range(n)]
def p0(b,yes="Yes",no="No"): print((yes if b else no))
# from sys import setrecursionlimit
# setrecursionlimit(1000000)
# from collections import Counter,deque,defaultdict
# import itertools
# import math
# import networkx
# from bisect import bisect_left,bisect_right
# from heapq import heapify,heappush,heappop
n=n0()
h=n1()
c=h[n-1]
f=True
for i in range(n-1,-1,-1):
if c>h[i]:
c=h[i]
elif c+1>=h[i]:
continue
else:
f=False
break
p0(f)
|
def s0():return eval(input())
def s1():return input().split()
def s2(n):return [eval(input()) for x in range(n)]
def s3(n):return [input().split() for _ in range(n)]
def s4(n): return [[x for x in s] for s in s2(n)]
def n0():return int(eval(input()))
def n1():return [int(x) for x in input().split()]
def n2(n):return [int(eval(input())) for _ in range(n)]
def n3(n):return [[int(x) for x in input().split()] for _ in range(n)]
def t3(n):return [tuple(int(x) for x in input().split()) for _ in range(n)]
def p0(b,yes="Yes",no="No"): print((yes if b else no))
# from sys import setrecursionlimit
# setrecursionlimit(1000000)
# from collections import Counter,deque,defaultdict
# import itertools
# import math
# import networkx
# from bisect import bisect_left,bisect_right
# from heapq import heapify,heappush,heappop
n=n0()
h=n1()
c=h[n-1]
f=True
for i in range(n-2,-1,-1):
if c>h[i]:
c=h[i]
elif c+1>=h[i]:
continue
else:
f=False
break
p0(f)
| p02953 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.