2021牛客暑期多校训练营10 Browser Games

#include<bits/stdc++.h>
using namespace std;
const int N=1e5+10;
char s[N][105];int n,id[N];
bool cmp(int x,int y){return strcmp(s[x],s[y])<0;}
int ans[N];
void dfs(int l,int r,int x,int k){
    if(l==r) return ;
    int i,j,maxi=0;
    for(i=l,j=l;i<=r;i++){
        maxi=max(maxi,id[i]);
        if(i==r||s[id[i]][k]!=s[id[i+1]][k]){
            ans[maxi]++;ans[x]--;
            dfs(j,i,maxi,k+1);
            maxi=0;j=i+1;
        }
    }
}
int main(){
    scanf("%d",&n);for(int i=1;i<=n;i++) {scanf("%s",s[i]);id[i]=i;}
    sort(id+1,id+1+n,cmp);
    if(n==1) {printf("1\n");return 0;}
    dfs(1,n,n+1,0);
    for(int i=1;i<=n;i++) ans[i]+=ans[i-1],printf("%d\n",ans[i]);
}