显然是一个二分答案，关键是怎么搞判断函数？

我们维护合法的降落区间就好了~

// Problem: D. Jumping Through Segments
// Contest: Codeforces - Codeforces Round 913 (Div. 3)
// URL: https://codeforces.com/contest/1907/problem/D
// Memory Limit: 256 MB
// Time Limit: 5000 ms
// 
// Powered by CP Editor (https://cpeditor.org)#include<bits/stdc++.h>
using namespace std;
using ll=long long;
const int N = 2e5+10;
int n;
struct Edge{ll l,r;
}edge[N];bool check(ll x){ll st =0,ed = 0;for(int i=1;i<=n;i++){st = max(st-x,edge[i].l);ed = min(ed+x,edge[i].r);if(st>ed)return 0;}return 1;}
void solve()
{cin>>n;for(int i=1;i<=n;i++)cin>>edge[i].l>>edge[i].r;ll l =-1,r = 1e9+10;while(l+1!=r){ll mid = (l+r)/2;if(check(mid))r = mid;else l =mid;}cout<<r<<"\n";}int main()
{ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);int _;cin>>_;while(_--)solve();return 0;
}