cf913 D

Problem - D - Codeforces 

#include<iostream>
#include<algorithm>
#include<cstring>
#include<vector>
#include<cmath>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef pair<int,int> PII;
#define int long long
const int N=2e5+10;
map<int,int> mp;
int x[N],y[N];
int n;
bool check(int k){
	int l=0,r=0;
	for(int i=1;i<=n;i++){
		int ll=l-k;
		int rr=r+k;
		if(ll>y[i]||rr<x[i]) return false;
		l=max(ll,x[i]),r=min(rr,y[i]);
	}
	return true;
}
signed main(){
	int T=1;
	cin>>T;
	while(T--){
		cin>>n;
		for(int i=1;i<=n;i++){
			cin>>x[i]>>y[i];
		}
		int l=0,r=1e9;
		while(l<r){
			int mid=l+r>>1;
			if(check(mid)) r=mid;
			else l=mid+1;
		}
		cout<<l<<endl;
	}
	return 0;
}