neuoj Blurred Pictures（小思维题

#include<bits/stdc++.h>
using namespace std;
const int maxn = 1e5+10;
int l[maxn],r[maxn];
int n;

inline bool check(int up,int d){
    if(l[up]+d-1>r[up]) return false;
    if(up+d-1>n) return false;
    int down = up+d-1;
    int left = max(l[up],l[down]);
    if(left+d-1<=r[up]&&left+d-1<=r[down]) return true;
    return false;
}


int main(){
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    while(cin>>n){
        for(int i=1;i<=n;i++) cin>>l[i]>>r[i];
        int ans = 1;
        for(int i=1;i<=n;i++) {
            while(check(i,ans+1)) ++ans;
        }
        cout<<ans<<endl;
    }
    return 0;
}