UVA 1623 Enther the Dragon 神龙喝水

#include<bits/stdc++.h>
#define PB push_back
#define MP make_pair
#define fi first
#define second
#define FOR(i,s,e) for(int i = s; i < e; i++)
using namespace std;

const int maxn = 1e6+5;

int lastTime[maxn];

int drink[maxn];
set<int> unUsedNoRainDays;
vector<int> NoRainDays;

int main()
{
    //freopen("in.txt","r",stdin);
    set<int> &s = unUsedNoRainDays;
    vector<int> &v = NoRainDays;
    int *d = drink;
    int *lT = lastTime;
    int T; scanf("%d",&T);
    for(int k = 1; k <= T; k++){
        int n,m; scanf("%d%d",&n,&m);
        memset(lastTime+1,0,sizeof(int)*n);

        s.clear(); v.clear();
        bool fail = false;
        for(int i = 1; i <= m; i++) {
            int t;
            scanf("%d",&t);
            if(t){
                set<int>::iterator it = s.lower_bound(lT[t]);
                if(it != s.end()){
                    d[*it] = t;
                    lT[t] = i;
                    s.erase(it);
                }else {
                    for(; i < m; i++) scanf("%d",&t);
                    fail = true;
                }
            }else {
                v.PB(i);
                d[i] = 0;
                s.insert(i);
            }
        }
        if(fail){
            puts("NO");
        }else {
            printf("YES"); printf("\n%d",d[v[0]]);
            for(int i = 1; i < v.size(); i++){
                printf(" %d",d[v[i]]);
            }
            putchar(‘\n‘);
        }
    }
    return 0;
}