题解:反着搜,从[l,r]区间去拓展到其他四个区间[l,2r-l],l,2r-l+1,[2l-r-2,r]2l-r-1,r,然后dfs这四个区间就好啦!
#include<cmath>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
long long int t,L,R,lim,ans;
void dfs(long long int l,long long int r)
{
if(r>ans||r>lim||l<0)return ;
if(l==0)
{
ans=min(ans,r);
return ;
}
if(2*l<r)return ;
if(2*l-r-1>=0)dfs(2*l-r-1,r);
if(2*l-r-2>=0)dfs(2*l-r-2,r);
if(2*r-l<=lim)dfs(l,2*r-l);
if(2*r-l+1<=lim)dfs(l,2*r-l+1);
}
int main()
{
scanf("%lld",&t);
for(int w=1;w<=t;w++)
{
scanf("%lld%lld%lld",&L,&R,&lim);
ans=2147483647;
if(L==R)
{
printf("%lld\n",R);
continue;
}
dfs(L,R);
if(ans<2147483647)printf("%lld\n",ans);
else printf("-1\n");
}
return 0;
}