Codeforces Round #679 题目 ：Shurikens

#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define fast ios_base::sync_with_stdio(0), cin.tie(0),cout.tie(0)
int n;
int a[100010],b[100010],c[200010],vv[200010];
int vis[200010];string s;
int main()
{
    cin>>n;int v;
    set<int>q;
    for(int i=1;i<=2*n;i++)
    {
        cin>>s;vis[i]=1;
        if(s=="+")q.insert(i);
        else{
            cin>>vv[i];
            a[vv[i]]=i;vis[i]=0;
        }
    }
    for(int i=1;i<=n;i++)
    {
        auto f=q.upper_bound(a[i]);
        --f;
        b[i]=*f;q.erase(f);
        c[b[i]]=i;
    }
    int tp=1;q.clear();
    for(int i=1;i<=2*n;i++)
    {
        if(vis[i]){q.insert(c[i]);}
        else {
                if(q.size()==0){tp=0;break;}
                if(*q.begin()==vv[i])q.erase(q.begin());
                else {tp=0;break;}
         }
    }
    if(tp)
    {
        cout<<"YES\n";
        for(int i=1;i<=2*n;i++)
        {
            if(vis[i]){cout<<c[i]<<" ";}
        }puts("");
    }
    else cout<<"NO\n";
    return 0;
}