提出 #71489168

---

ソースコード 拡げる

import sys
sys.setrecursionlimit(10 ** 6)

# import numpy as np
# <nonumba> from numba import njit, jit, boolean, int64, float64, typeof




def main():
    from io import StringIO
    execute(StringIO(sample), sys.stderr)
    print("-- ^sample! --", file=sys.stderr)

    execute(sys.stdin, sys.stdout)

    # #<nonumba> if len(solve.nopython_signatures) != 1:
    # #<nonumba>     raise KeyboardInterrupt("!! Unexpected: wrong use of jit !!")

def execute(src, dst):

    N = int(src.readline())
    A = [-9] + list(map(int, src.readline().split()))

    ans = solve(N, A)
    print(ans, file=dst)

sample = """\
4
3 1 4 1
"""

# #<nonumba> @jit(nopython=True, cache=True)
def solve(N , A):
    ans = 0
    top = 1
    for i in range(1, N+1) :
        if i <= top:
            ans += 1
            top = max(top , i + A[i] -1)

    return ans




main()

提出情報

ジャッジ結果