{"categories":["Haskell"],"html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fwvogel00.hatenadiary.org%2Fentry%2F20110930%2F1317398402\" title=\"ants - wvogel\u65e5\u8a18\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>","width":"100%","blog_title":"wvogel\u65e5\u8a18","version":"1.0","provider_name":"Hatena Blog","type":"rich","image_url":null,"author_url":"https://blog.hatena.ne.jp/wvogel00/","provider_url":"https://hatena.blog","description":"ttp://poj.org/problem?id=1852 \u306b\u3042\u308b\u3001\u87fb\u306e\u554f\u984c\u3002\uff08POJ,No.1852\uff09 \u3069\u3046\u3084\u308b\u306e\u304b\u601d\u3044\u3064\u304b\u306a\u304b\u3063\u305f\u3051\u3069\u3001\u89e3\u653e\u8aad\u3093\u3060\u3089\u611f\u52d5\u3057\u305f\u306e\u3067\u66f8\u3044\u3066\u307f\u305f\u3002 datalist :: Int -> String -> [Int] datalist n = map read.take n.words minf :: Int -> [Int] -> Int minf l = foldl max 0.map (\\x->min x (l-x)) maxf :: Int -> [Int] -> Int maxf l = foldl max 0.map (\\x->min l (l-x))\u2026","published":"2011-09-30 01:00:02","height":"190","title":"ants","author_name":"wvogel00","url":"https://wvogel00.hatenadiary.org/entry/20110930/1317398402","blog_url":"https://wvogel00.hatenadiary.org/"}