{"categories":[],"author_name":"math314","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fmath314.hateblo.jp%2Fentry%2F2014%2F01%2F04%2F234609\" title=\"ICPC Asia 2013 Problem G: Longest Chain - math314\u306e\u30d6\u30ed\u30b0\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>","version":"1.0","width":"100%","provider_url":"https://hatena.blog","provider_name":"Hatena Blog","height":"190","blog_url":"https://math314.hateblo.jp/","author_url":"https://blog.hatena.ne.jp/math314/","title":"ICPC Asia 2013 Problem G: Longest Chain","type":"rich","published":"2014-01-04 23:46:09","blog_title":"math314\u306e\u30d6\u30ed\u30b0","image_url":null,"description":"http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=1341 \u901a\u308a\u307e\u305b\u3093\u3067\u3057\u305f\u3001\u8f9b\u3044 2014/01/05 00:22 \u901a\u308a\u307e\u3057\u305f \u6295\u3052\u305f\u30b3\u30fc\u30c9(AC) O((m+n) log (m+n))? #include <map> #include <iostream> #include <vector> #include <algorithm> using namespace std; #define FOR(i,n) for(int i = 0; i < (n); i++) #define sz(c) ((int)(c).size())\u2026","url":"https://math314.hateblo.jp/entry/2014/01/04/234609"}