HDU 3974 Assign the task 简单搜索

//#pragma comment(linker, "/STACK:16777216") //for c++ Compiler
#include <stdio.h>
#include <iostream>
#include <cstring>
#include <cmath>
#include <stack>
#include <queue>
#include <vector>
#include <algorithm>
#define ll long long
#define Max(a,b) (((a) > (b)) ? (a) : (b))
#define Min(a,b) (((a) < (b)) ? (a) : (b))
#define Abs(x) (((x) > 0) ? (x) : (-(x)))

using namespace std;

const int INF = 0x3f3f3f3f;
struct sc{
    int work, leader, time;
}a[50001];

int main(){
    std::ios::sync_with_stdio(false);
    int i, j, k, t, n, m, u, v, num, tt, caseNum, ttime;
    char cmd;
    caseNum = 0;
    cin >> t;
    while(t--){
        int tim = 0;
        for(i = 1; i <= 50000; ++i){
            a[i].work = -1;
            a[i].time = 0;
            a[i].leader = -1;
        }
        cin >> n;
        for(i = 1; i < n; ++i){
            cin >> u >> v;
            a[u].leader = v;
        }
        cout << "Case #" << ++caseNum << ":" << endl;
        cin >> m;
        while(m--){
            cin >> cmd;
            if(cmd == ‘C‘){
                cin >> num;
                ttime = a[num].time;
                int ans = a[num].work;
                while(num != -1){
                    num = a[num].leader;
                    if(ttime < a[num].time){
                        ans = a[num].work;
                        ttime = a[num].time;
                    }
                }
                cout << ans << endl;
            } else{
                cin >> num >> tt;
                a[num].work = tt;
                a[num].time = ++tim;
            }
        }
    }
    return 0;
}