{"width":"100%","categories":["PKU"],"url":"https://h-chiro.hatenablog.com/entry/20101031/1288535343","image_url":null,"blog_title":"\u96d1\u8a18","author_url":"https://blog.hatena.ne.jp/h_chiro/","description":"http://poj.org/problem?id=2263 \u6982\u8981 \u51fa\u767a\u70b9\u304b\u3089\u76ee\u7684\u5730\u307e\u3067\u306e\u30d1\u30b9\u306e\u4e2d\u3067\u3001\u30d1\u30b9\u306e\u6700\u5c0f\u5bb9\u91cf\u306e\u8fba\u306e\u5bb9\u91cf\u304c\u6700\u5927\u306b\u306a\u308b\u3088\u3046\u306a\u30d1\u30b9\u3092\u898b\u3064\u3051\u308b\u554f\u984c\u3002 \u305f\u3060\u5c11\u3057\u5165\u529b\u304c\u9762\u5012\u3002 \u30bd\u30fc\u30b9 #include<iostream> #include<cstring> #include<string> #include<map> using namespace std; #define REP(i,a,b) for(i=a; i<b; ++i) #define rep(i,n) REP(i,0,n) int cap[200][200]; int n; int main() { int scen\u2026","title":" 2263 Heavy Cargo","type":"rich","provider_url":"https://hatena.blog","blog_url":"https://h-chiro.hatenablog.com/","height":"190","author_name":"h_chiro","published":"2010-10-31 23:29:03","version":"1.0","provider_name":"Hatena Blog","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fh-chiro.hatenablog.com%2Fentry%2F20101031%2F1288535343\" title=\" 2263 Heavy Cargo - \u96d1\u8a18\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>"}