Submission #1230755

---

Source Code Expand

import Control.Applicative
import Control.Monad
import Data.List

udl :: [Int] -> [Int]
udl (e:ls) =
  ch 0 e ls
  where
    ch n _ [] = [n]
    ch n p (c:l)
      | p < c = ch (n+1) c l
      | otherwise = n:(ch 0 c l)

main :: IO ()
main = do
  [n, k] <- map read . words <$> getLine
  ls <- replicateM n readLn
  print $ sum $ map (\x -> x - k + 2)  $ filter (>= (k-1)) $ udl ls

Submission Info

Judge Result