UVALive - 7464 Robots 贪心+递归

递归处理： 把先把花费时间多的那种往花费时间少的那个上面传，

如果传完了 就单独 分别往 base 传和自身传

#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <queue>
#include <vector>
#include <set>
#include <stack>
#include <map>
#include <climits>

using namespace std;

typedef long long ll;
const int maxn = 250 + 7, INF = 0x3f3f3f3f, mod = 1e9 + 7;

int x, y, m, n;

int solve(int a, int b) { // number
    //cout << a << " == " <<  b << endl;
    if(!a && !b) return 0;
    if(!b) return (x + solve((a/2), b));
    if(!a) return (y + solve(a, b/2));
    if(a < b) {
        return y + solve( a, (b-a)/2 );
    }
    else {
        return y + solve( (a-b+2)/2+b-1, 0);
    }
}

int main() {
    int T;
    scanf("%d", &T);
    while(T--) {
        scanf("%d %d %d %d", &x, &y, &m, &n);
        int ans = solve(m, n);
        cout << ans << endl;
    }
    return 0;
}