{"provider_url":"https://hatena.blog","blog_url":"https://a-kawashiro.hatenablog.com/","published":"2011-04-26 13:24:07","author_url":"https://blog.hatena.ne.jp/a_kawashiro/","categories":["topcoder"],"url":"https://a-kawashiro.hatenablog.com/entry/20110426/1303791847","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fa-kawashiro.hatenablog.com%2Fentry%2F20110426%2F1303791847\" title=\"SRM486 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>","version":"1.0","image_url":null,"provider_name":"Hatena Blog","blog_title":"a_kawashiro\u306e\u30d6\u30ed\u30b0","height":"190","description":"\u3069\u3063\u304b\u3067\u3084\u3063\u305f\u3053\u3068\u304c\u3042\u308b\u3088\u3046\u306a\u6c17\u304c\u3059\u308b\u3002 \u30e1\u30e2\u5316\u518d\u5e30\u3002 #include <vector> #include <map> using namespace std; class QuickSort { public: map<vector<int>,double> cache; double rec(vector<int> L) { double r; if(L.size()<2) r=0.0; else if(cache.find(L)!=cache.end()) return cache[L]; else { r=0.0; int n=L.size(); for(int i=0;i<n;i+\u2026","width":"100%","title":"SRM486 div1 medium","type":"rich","author_name":"a_kawashiro"}