{"blog_url":"https://a-kawashiro.hatenablog.com/","height":"190","author_url":"https://blog.hatena.ne.jp/a_kawashiro/","version":"1.0","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fa-kawashiro.hatenablog.com%2Fentry%2F20110423%2F1303545683\" title=\"SRM387 div1 medium - a_kawashiro\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>","type":"rich","author_name":"a_kawashiro","provider_name":"Hatena Blog","width":"100%","title":"SRM387 div1 medium","categories":["topcoder"],"url":"https://a-kawashiro.hatenablog.com/entry/20110423/1303545683","blog_title":"a_kawashiro\u306e\u30d6\u30ed\u30b0","provider_url":"https://hatena.blog","description":"\u52d5\u7269\u7684\u76f4\u611f\u3067AC\u3002 #include <algorithm> #include <cstdio> #include <cstring> #include <utility> #include <vector> using namespace std; class IntervalSubsets { public: int n; int cache[55]; vector<pair<int,int> > interval; int rec(int p) { int &r=cache[p]; if(r!=-1) return r; else { r=0; int ss=interval[p].se\u2026","published":"2011-04-23 17:01:23","image_url":null}