結果

問題 No.999 てん vs. ほむ
ユーザー dot_haraai
提出日時 2021-04-02 20:24:32
言語 Nim
(2.2.0)
結果
AC  
実行時間 44 ms / 2,000 ms
コード長 970 bytes
コンパイル時間 4,909 ms
コンパイル使用メモリ 86,144 KB
実行使用メモリ 10,240 KB
最終ジャッジ日時 2024-12-23 16:45:31
合計ジャッジ時間 6,724 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 20
権限があれば一括ダウンロードができます
コンパイルメッセージ
/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(2*n,scan())
    left = newseq[int](n)
    right = newseq[int](n)
  left[0]=a[0]-a[1]
  right[n-1]=a[2*n-1]-a[2*n-2]
  for i in 1..<n:
    #echo a[(n-i)*2+1], ", ",-a[(n-i)*2]
    left[i]=left[i-1]+a[i*2]-a[i*2+1]
    right[n-i-1]=right[n-i]+a[(n-i-1)*2+1]-a[(n-i-1)*2]
  result=max(left[n-1],right[0])
  for i in 0..<n-1:
    result.max=left[i]+right[i+1]

  
  
  
  
echo solve()
0