結果

問題 No.672 最長AB列
ユーザー dot_haraai
提出日時 2021-04-08 23:05:39
言語 Nim
(2.2.0)
結果
AC  
実行時間 13 ms / 2,000 ms
コード長 1,179 bytes
コンパイル時間 4,225 ms
コンパイル使用メモリ 86,356 KB
実行使用メモリ 11,816 KB
最終ジャッジ日時 2024-06-24 01:24:40
合計ジャッジ時間 5,269 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 16
権限があれば一括ダウンロードができます
コンパイルメッセージ
/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')



const
  r = 200001
var
  fIdx : array[-r..r, int]
  lIdx : array[-r..r, int]


proc solve():int=
  var
    s = read()
    n = s.len
    cum = newseqwith(n,0)
  
  for i in -r..r:
    fIdx[i] = -2
    lIdx[i] = -2
  fIdx[0] = -1
  lIdx[0] = -1
  if s[0]=='A':
    cum[0]= 1
  else:
    cum[0]= -1
  fIdx[cum[0]]=0
  lIdx[cum[0]]=0
  for i in 1..<n:
    if s[i]=='A':
      cum[i]=cum[i-1]+1
    else:
      cum[i]=cum[i-1]-1
    if fIdx[cum[i]] == -2:
      fIdx[cum[i]] = i
    lIdx[cum[i]] = i
  #echo cum
  for i in -r..r:
    #if fIdx[i] != -1 and lIdx[i] != -1:
    result.max = lIdx[i] - fIdx[i]
  return


  

  
  

  
  
  

  
echo solve()
0