1206.[S/Wトラブルシューティングネイティブ]1日目-ビュー

1.解法

2 max()関数の使用

for test_case in range(1, 11):
    width = int(input())
    building = list(map(int, input().split()))
    cnt = 0
    for i in range(2, width - 2):
        max_building = max(building[i - 2], building[i - 1], building[i + 1], building[i + 2])
        if building[i] > max_building:
            cnt += (building[i] - max_building)
    print('#{0} {1}'.format(test_case, cnt))

3.for構文を使用して直接最大値を求める

for test_case in range(1, 11):
    width = int(input())
    building = list(map(int, input().split()))
    cnt = 0
    for i in range(2, width - 2):
        max_building = building[i - 2]
        for j in range(i - 1, i + 3):
            if j == i:
                continue
            if max_building < building[j]:
                max_building = building[j]
        if building[i] > max_building:
            cnt += (building[i] - max_building)
    print('#{0} {1}'.format(test_case, cnt))