{"type":"rich","image_url":null,"height":"190","provider_url":"https://hatena.blog","author_url":"https://blog.hatena.ne.jp/anta1/","blog_title":"anta\u306e\u7af6\u6280\u30d7\u30ed\u30b0\u30e9\u30df\u30f3\u30b0\u7df4\u7fd2\u65e5\u8a18","description":"\u554f\u984c Editorial \u554f\u984c \u753b\u50cf\u304c\u4e0a\u624b\u304f\u8868\u73fe\u3067\u304d\u306a\u3044\u306e\u3067\u7565 \u89e3\u7b54 (\u4ea4\u5dee\u70b9\u306e(x * y * (\u771f\u3093\u4e2d, \u56db\u9685)))\u3067DP\u3059\u308b\u3060\u3051\u3002 (width \u30b3\u30e1\u30f3\u30c8 \u3053\u308c\u306f\u4e00\u77ac\u3067\u89e3\u3051\u308b\u3079\u304d \u30b3\u30fc\u30c9 #include <string> #include <algorithm> #include <cstring> #include <complex> #define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i)) #define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i)) #define mp(x,y\u2026","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fanta1.hatenadiary.org%2Fentry%2F20130117%2F1358423085\" title=\"SRM 272 DIV1 Hard ManhattanDistance - anta\u306e\u7af6\u6280\u30d7\u30ed\u30b0\u30e9\u30df\u30f3\u30b0\u7df4\u7fd2\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>","blog_url":"https://anta1.hatenadiary.org/","version":"1.0","provider_name":"Hatena Blog","title":"SRM 272 DIV1 Hard ManhattanDistance","url":"https://anta1.hatenadiary.org/entry/20130117/1358423085","author_name":"anta1","width":"100%","published":"2013-01-17 20:44:45","categories":["SRM","DP"]}