結果

問題 No.921 ずんだアロー
ユーザー dot_haraai
提出日時 2021-03-09 22:09:16
言語 Nim
(2.2.0)
結果
AC  
実行時間 25 ms / 2,000 ms
コード長 1,078 bytes
コンパイル時間 4,185 ms
コンパイル使用メモリ 87,824 KB
実行使用メモリ 9,856 KB
最終ジャッジ日時 2024-10-11 12:37:34
合計ジャッジ時間 5,578 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 22
権限があれば一括ダウンロードができます
コンパイルメッセージ
/home/judge/data/code/Main.nim(2, 18) Warning: Use the new 'sugar' module instead; future is deprecated [Deprecated]
/home/judge/data/code/Main.nim(1, 8) Warning: imported and not used: 'times' [UnusedImport]
/home/judge/data/code/Main.nim(2, 26) Warning: imported and not used: 'strformat' [UnusedImport]
/home/judge/data/code/Main.nim(2, 18) Warning: imported and not used: 'future' [UnusedImport]
/home/judge/data/code/Main.nim(2, 37) Warning: imported and not used: 'deques' [UnusedImport]
/home/judge/data/code/Main.nim(1, 41) Warning: imported and not used: 'algorithm' [UnusedImport]
/home/judge/data/code/Main.nim(1, 52) Warning: imported and not used: 'tables' [UnusedImport]
/home/judge/data/code/Main.nim(1, 60) Warning: imported and not used: 'sets' [UnusedImport]
/home/judge/data/code/Main.nim(1, 66) Warning: imported and not used: 'lists' [UnusedImport]
/home/judge/data/code/Main.nim(1, 73) Warning: imported and not used: 'intsets' [UnusedImport]
/home/judge/data/code/Main.nim(2, 8) Warning: imported and not used: 'critbits' [UnusedImport]

ソースコード

diff # 

import times, strutils, sequtils, math, algorithm, tables, sets, lists, intsets
import critbits, future, strformat, deques
template `max=`(x,y) = x = max(x,y)
template `min=`(x,y) = x = min(x,y)
template `mod=`(x,y) = x = x mod y
template scan2 = (scan(), scan())
template scan3 = (scan(), scan())
let read* = iterator: string {.closure.} =
    while true: (for s in stdin.readLine.split: yield s)
proc scan(): int = read().parseInt
proc scanf(): float = read().parseFloat
proc toInt(c:char): int =
    return int(c) - int('0')



proc solve():int=
  var
    n = scan()
    a = newseqwith(n,scan())
    dp = newseqwith(n,newseqwith(2,0))
    cont = newseqwith(n,0)
  dp[0][1]=1
  dp[0][0] = 0
  cont[0]=1
  for i in 1..<n:
    dp[i][0]=max(dp[i-1])
    if a[i]==a[i-1]:
      dp[i][1]=max(dp[i-1][1]+1, dp[i-1][0]+1)
      cont[i]=cont[i-1]+1
    elif a[i]>a[i-1]:
      cont[i]=1
      dp[i][1]=max(dp[i-1][1]+1-cont[i-1],dp[i-1][0]+1)
    elif a[i]<a[i-1]:
      dp[i][1]=max(dp[i-1][1],dp[i-1][0]+1)
      cont[i]=1
  #echo dp.join("\n")
  return dp[n-1].max




echo solve()
0