Codeforces Round 916 (Div. 3)(E:贪心 F贪心dfs G tarjan+topsort +线段树优化建图)

A：直接暴力统计每个字符的次数是否达标即可

#includeusing namespace std;const int N = 3e5+10,mod=998244353;#define int long longtypedef long long LL;typedef pair PII;typedef unsigned long long ULL; const long long inf=1e17;using node=tuple;int n,m,k;int a[N];void solve(){    cin>>n;    string s;cin>>s;    map mp;    for(auto x:s)mp[x-'A'+1]++;    int res=0;    for(int i=1;i=i) res++;    }    coutn>>k;    int l=1,r=n;    for(int i=n-k;ib[i];    for(int i=1;i>c[i];        auto get=[&](vector&a,vector&b,vector&c){        int mx=0;        vector l(n+10),r(n+10);        for(int i=1;i=1;i--) r[i]=max(r[i+1],c[i]);        for(int i=2;ia[i];    for(int i=1;i>b[i];    vector st(n+10);    priority_queue q;    for(int i=1;i