{"blog_url":"https://area.hateblo.jp/","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Farea.hateblo.jp%2Fentry%2F2013%2F02%2F05%2F051642\" title=\"POJ 2081 Recaman&#39;s Sequence - Area1\u306eif(memo[i][j])\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>","provider_name":"Hatena Blog","version":"1.0","image_url":null,"type":"rich","description":"\u554f\u984c\u6587DP\u5f37\u5316\u9031\u9593\u3002\u554f\u984c\u6982\u8981\u306f\u7c21\u5358\u306a\u306e\u3067\u7565\u3002\u554f\u984c\u3082\u5c0f\u3055\u3044\u65b9\u304b\u3089\u30e1\u30e2\u5316\u3057\u3066\u8a08\u7b97\u3057\u3066\u3044\u304f\u3060\u3051\u3002 \u4ee5\u4e0b\u30bd\u30fc\u30b9\u3002 int a[500001]; int main(int argc, char **argv){ a[0] = 0; set<int> rec; for(int i = 1; i <= 500000; i++){ int t = a[i - 1] - i; int u = a[i - 1] + i; set<int>::iterator it = rec.find(t); if(t > 0 && it == rec.end()){ a[i] = t; rec.insert(t); }else\u2026","url":"https://area.hateblo.jp/entry/2013/02/05/051642","blog_title":"Area1\u306eif(memo[i][j])","categories":["POJ","DP"],"author_url":"https://blog.hatena.ne.jp/Area1/","title":"POJ 2081 Recaman's Sequence","height":"190","provider_url":"https://hatena.blog","author_name":"Area1","published":"2013-02-05 05:16:42","width":"100%"}