HDU 5802 Windows 10 （贪心+dfs）

Windows 10

题目链接：

http://acm.hdu.edu.cn/showproblem.php?pid=5802

Description

Long long ago, there was an old monk living on the top of a mountain. Recently, our old monk found the operating system of his computer was updating to windows 10 automatically and he even can't just stop it !!
With a peaceful heart, the old monk gradually accepted this reality because his favorite comic LoveLive doesn't depend on the OS. Today, like the past day, he opens bilibili and wants to watch it again. But he observes that the voice of his computer can be represented as dB and always be integer.
Because he is old, he always needs 1 second to press a button. He found that if he wants to take up the voice, he only can add 1 dB in each second by pressing the up button. But when he wants to take down the voice, he can press the down button, and if the last second he presses the down button and the voice decrease x dB, then in this second, it will decrease 2 * x dB. But if the last second he chooses to have a rest or press the up button, in this second he can only decrease the voice by 1 dB.
Now, he wonders the minimal seconds he should take to adjust the voice from p dB to q dB. Please be careful, because of some strange reasons, the voice of his computer can larger than any dB but can't be less than 0 dB.

Input

First line contains a number T (1≤T≤300000),cases number.
Next T line,each line contains two numbers p and q (0≤p,q≤109)

Output

The minimal seconds he should take

Sample Input

2
1 5
7 3

Sample Output

4
4

Source

2016 Multi-University Training Contest 6


##题意：

要把音量从p调节到q. 每次调节需要1秒：
1. 按up会+1.
2. 按down：若上一秒是休息/up则-1；若上一秒下降x则-2*x.


##题解：

比赛的时候没有想清楚，看了题解后才知道贪心就可以了.
若pq , 贪心的想法是一直按down(中间可能停顿)直到p

##代码：
``` cpp
#include
#include
#include
#include
#include
#include
#include
#include
#include
#define LL long long
#define eps 1e-8
#define maxn 150
#define mod 110119
#define inf 0x3f3f3f3f
#define mid(a,b) ((a+b)>>1)
#define IN freopen("in.txt","r",stdin);
using namespace std;

LL s, t;

LL dfs(LL cur, LL step, LL stop) {

if(cur == t) return step;

LL down = 0;

while(cur - (1<<down) + 1 > t) down++;

step += down;

if(cur - (1<<down) + 1 == t) return step;

LL up = t - max(0LL, cur - (1<<down) + 1);

return min(step+max(up-stop,0LL), dfs(cur-(1<<(down-1))+1, step, stop+1));

}

int main(int argc, char const *argv[])

{

//IN;

int T; cin >> T;
while(T--)
{
    cin >> s >> t;

    LL ans = 0;
    if(s <= t) ans = t - s;
    else ans = dfs(s, 0, 0);

    printf("%lld\n", ans);
}

return 0;

}