{"published":"2014-01-31 15:48:31","categories":[],"title":"Codeforces #160 Div1 D. Maxim and Increasing Subsequence","image_url":null,"blog_title":"\u3088\u3059\u307d\u306e\u65e5\u8a18","type":"rich","description":"\u87fb\u672c\u306e\u30a2\u30eb\u30b4\u30ea\u30ba\u30e0\u3092\u5199\u7d4c\u3057\u305f\u3089\u901a\u3063\u3066\u3057\u307e\u3063\u305f\u20265304/6000ms\u306a\u306e\u3067\u3069\u3046\u8003\u3048\u3066\u3082\u5618\u89e3\u6cd5 \u3057\u304b\u3082\u30c6\u30b9\u30c8\u30b1\u30fc\u30b9\u304c\u7518\u3044\u304b\u3089\u3063\u307d\u3044\u2026N=10^6 MAX_B=200 T=199\u307f\u305f\u3044\u306a\u306e\u3067\u7c21\u5358\u306b\u843d\u3068\u305b\u308b\u30cf\u30ba O(K*N*MAX_B*log(N))\u306e\u306f\u305a #include <cstdio> #include <cmath> #include <cstring> #include <ctime> #include <iostream> #include <algorithm> #include <set> #include <vector> #include <sstream> #include <\u2026","blog_url":"https://yosupo.hatenablog.com/","url":"https://yosupo.hatenablog.com/entry/2014/01/31/154831","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fyosupo.hatenablog.com%2Fentry%2F2014%2F01%2F31%2F154831\" title=\"Codeforces #160 Div1 D. Maxim and Increasing Subsequence - \u3088\u3059\u307d\u306e\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>","author_name":"yosupo","width":"100%","height":"190","version":"1.0","provider_url":"https://hatena.blog","author_url":"https://blog.hatena.ne.jp/yosupo/","provider_name":"Hatena Blog"}