9/12 思维训练

C. Digital Logarithm 使用优先队列模拟这个元素消去的过程。

#include
#define int long long
#define endl '\n'
#define For(i,a,b) for(i=(a);i>=1;
    }
    return res;
}
int getinv(int x){return qpow(x,mod-2);}
int C(int a,int b)
{
    return (fac[a]*getinv(fac[a-b])%mod)*getinv(fac[b])%mod;
}

int n;
priority_queuea,b;
void solve()
{
    cin>>n;
    for(int i=1;i>x;
        a.push(x);
    }
    for(int i=1;i>x;
        b.push(x);
    }
    int ans=0;
    while(!a.empty()&&!b.empty())
    {
        int x=a.top();
        int y=b.top();
        if(x==y)
        {
            a.pop();b.pop();continue;
        }
        ans++;
        if(x>y)
        {
            a.pop();
            a.push(to_string(x).length());
        }
        else
        {
            b.pop();
            b.push(to_string(y).length());
        }
    }
    cout>n>>k;
    for(int i=1;i>a[i];
    int ans=0,sum=0;
    for(int i=1;i=j-i+1;
            tp+=g;
        }
        ans=max(ans,tp);
        sum+=a[i]-k;
    }
    ans=max(ans,sum);
    coutb;}
void dfs(int x,int pre)
{
    sz[x]=1;
    for(int y:e[x])
    {
        if(y==pre) continue;
        dfs(y,x);
        sz[x]+=sz[y];
    }
    for(int y:e[x])
    {
        if(y==pre) continue;
        f[x]=max(f[x],f[y]+sz[x]-sz[y]-2);
    }
    for(int y:e[x])
    {
        if((pre==0&&e[x].size()==1)||(pre!=0&&e[x].size()==2))
           f[x]=max(f[x],sz[x]-2);
    }
}
void solve()
{
    cin>>n;
    for(int i=0;iu>>v;
        e[u].push_back(v);e[v].push_back(u);
    }
    dfs(1,0);
    coutb;}
int n,ans,sum[N];
bool vis[N];
vectore[N];

void solve()
{
    string s;cin>>s;
    int g=count(s.begin(),s.end(),'1'),n=s.length();
    s=" "+s;
    for(int i=1;in>>k;
    for(int i=1;i>a[i];
        sum[i]=sum[i-1]+a[i];
    }
    int ans=0;
    if(k