結果

問題 No.1031 いたずら好きなお姉ちゃん
ユーザー MNGOF
提出日時 2020-04-26 21:41:41
言語 Python3
(3.13.1 + numpy 2.2.1 + scipy 1.14.1)
結果
WA  
実行時間 -
コード長 1,791 bytes
コンパイル時間 364 ms
コンパイル使用メモリ 12,800 KB
実行使用メモリ 49,924 KB
最終ジャッジ日時 2024-11-18 11:31:07
合計ジャッジ時間 61,914 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 2 WA * 31 RE * 20
権限があれば一括ダウンロードができます

ソースコード

diff # 

import numpy as np


def solve_left(area, selected_ind):
    if area.shape[0] <= 1:
        return 0
    max_ind = np.argmax(area)
    min_ind = max_ind
    selected_ind[max_ind: selected_ind.shape[0]] = 0
    for i in range(max_ind+1, area.shape[0]):
        if area[min_ind] > area[i]:
            min_ind = i
            selected_ind[i] = 1
    count = np.sum(selected_ind)
    count += solve_left(area[0:max_ind], selected_ind[0:max_ind])
    count += solve_right(area[max_ind+1:area.shape[0]], selected_ind[max_ind+1:selected_ind.shape[0]])
    return count


def solve_right(area, selected_ind):
    if area.shape[0] <= 1:
        return 0
    max_ind = np.argmax(area)
    min_ind = max_ind
    selected_ind[0: max_ind + 1] = 0
    for i in reversed(range(max_ind)):
        if area[min_ind] > area[i]:
            min_ind = i
            selected_ind[i] = 1
    count = np.sum(selected_ind)
    count += solve_left(area[0:max_ind], selected_ind[0:max_ind])
    count += solve_right(area[max_ind+1:area.shape[0]], selected_ind[max_ind+1:selected_ind.shape[0]])
    return count


def solve(area):
    selected_ind = area*0
    max_ind = np.argmax(area)
    min_ind = max_ind
    for i in reversed(range(max_ind + 0)):
        if area[min_ind] > area[i]:
            min_ind = i
            selected_ind[i] = 1
    min_ind = max_ind
    for i in range(max_ind+1, area.shape[0]):
        if area[min_ind] > area[i]:
            min_ind = i
            selected_ind[i] = 1
    count = np.sum(selected_ind)
    count += solve_left(area[0:max_ind], selected_ind[0:max_ind])
    count += solve_right(area[max_ind+1:area.shape[0]], selected_ind[max_ind+1:selected_ind.shape[0]])
    return count

N = int(input())
input_np = np.array(input().split()).astype(np.int32)

print(solve(input_np))
0