Codeforces Round 916 (Div. 3)(E:贪心 F贪心dfs G tarjan+topsort +线段树优化建图)
A:直接暴力统计每个字符的次数是否达标即可#includeusingnamespacestd;constintN=3e5+10,mod=998244353;#defineintlonglongtypedeflonglongLL;typedefpairPII;typedefunsignedlonglongULL;constlonglonginf=1e17;usingnode=tuple;intn,m