結果

問題 No.1368 サイクルの中に眠る門松列
コンテスト
ユーザー dot_haraai
提出日時 2021-03-09 21:01:05
言語 Nim
(2.2.0)
結果
AC  
実行時間 52 ms / 2,000 ms
コード長 1,221 bytes
コンパイル時間 3,507 ms
コンパイル使用メモリ 86,784 KB
実行使用メモリ 18,048 KB
最終ジャッジ日時 2024-10-11 12:34:01
合計ジャッジ時間 5,536 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 1
other AC * 15
権限があれば一括ダウンロードができます
コンパイルメッセージ
/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()=
  var
    t = scan()

  
  proc score(a,b,c:int):int=
    if a!=b and b!=c and c!=a and ((a>b and b<c) or (a<b and b>c)):
      return a
    else:
      return -int.high.div(4)

  for i in 0..<t:
    var
      n = scan()
      a = newseqwith(n,scan())
      d = newseqwith(3,newseqwith(n,0))
    a = a&a

    
    for offs in 0..2:
      for i in 2..<n:
        if i>2:
          d[offs][i].max=max(d[offs][i-1],d[offs][i-3]+score(a[offs+i-2],a[offs+i-1],a[offs+i]))
        else:
          d[offs][i].max=max(d[offs][max(0,i-1)],score(a[offs+i-2],a[offs+i-1],a[offs+i]))
      #echo offs,",",d[offs]
    echo max(@[d[0][n-1],d[1][n-1],d[2][n-1]])




    
    
  

  
solve()
0