{"categories":["UVa"],"width":"100%","type":"rich","height":"190","version":"1.0","image_url":null,"blog_title":"Logfiles","author_name":"moistx","title":"UVa12321 Gas Station","url":"https://logfiles.hatenablog.com/entry/20140827/1409155962","author_url":"https://blog.hatena.ne.jp/moistx/","description":"\u89e3\u6cd5 \u30bd\u30fc\u30c8\u3057\u3066\u3001O(N) \u7a0b\u5ea6\u306e\u8caa\u6b32\u3002\u53cd\u7701 \u5165\u529b\u3067 [ max(0, X-R), min(L, X+R) ] \u3068\u7aef\u3092\u5207\u308b\u51e6\u7406\u304c\u629c\u3051\u3066\u3044\u305f\u305f\u3081\u305a\u3063\u3068TLE\u3057\u3066\u305f\u3002 int L, G; int solve(vector<pair<int, int>>& vec) { int l = 0, r = 0; int idx = 0; int cnt = 0; while(1) { while(1) { if(G <= idx || l < vec[idx].first) break; r = max(r, vec[idx].second); idx++; } l = r; cnt ++; if( r \u2026","blog_url":"https://logfiles.hatenablog.com/","provider_url":"https://hatena.blog","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Flogfiles.hatenablog.com%2Fentry%2F20140827%2F1409155962\" title=\"UVa12321 Gas Station - Logfiles\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>","published":"2014-08-27 01:12:42","provider_name":"Hatena Blog"}