Codeforce1041 D. Glider 尺取法

Codeforce1041 D. Glider

给定高度和水平滑翔区间,求最远滑翔距离

#include<bits/stdc++.h>
#define l first
#define r second
using namespace std;
const int MAX=2e5+5;
pair<int,int>a[MAX];
int b[MAX];
int n,h;
int main()
{
    while(~scanf("%d%d",&n,&h))
    {
        int ans=0;
        scanf("%d%d",&a[0].l,&a[0].r);b[0]=0;
        for(int i=1;i<n;++i)
        {
            scanf("%d%d",&a[i].l,&a[i].r);
            b[i]=b[i-1]+a[i].l-a[i-1].r;
        }
        for(int L=0,R=0;L<n;++L)
        {
            while(b[R+1]-b[L]<h&&R+1<n) ++R;
            if(ans<a[R].r-a[L].l+h+b[L]-b[R])
                ans=a[R].r-a[L].l+h+b[L]-b[R];
        }
        printf("%d\n",ans);
    }
    return 0;
}

猜你喜欢

转载自blog.csdn.net/Nrtostp/article/details/82740297
今日推荐