?
# | Author | Problem | Lang | Verdict | Time | Memory | Sent | Judged | |
---|---|---|---|---|---|---|---|---|---|
107870392 |
Practice: 4e1s3n8e7g |
1486A - 32 | Python 3 | Accepted | 155 ms | 284 KB | 2021-02-18 20:45:16 | 2021-02-18 20:45:16 |
def solve(): n = int(input()) l = list(map(int, input().split())) f = 1 if n == 1: print("YES") return if n==2: if l[0]==0 and l[1]==0: print("NO") return else: print("YES") return extra = l[0] for i in range(2, n): if l[i] > l[i - 1]: extra = extra + l[i] - l[i - 1] - 1 else: need = l[i - 1] - l[i] + 1 if need <= extra: extra = extra - need else: f = 0 break if f: print("YES") else: print("NO") def solve2(): n = int(input()) l = list(map(int, input().split())) f = 1 c = 0 extra = 0 for i in range(n): extra = extra + l[i]-i if extra<0: f = 0 break if f: print("YES") else: print("NO") def solve3(): n = int(input()) l = list(map(int, input().split())) f = 1 s = 0 for i in range(n): s += l[i] if s < i * (i + 1) // 2: f = 0 break if f: print("YES") else: print("NO") for testis in range(int(input())): solve2()
?
?
?
?