T y){x=(y>x?y:x);}template<typenameT>inlineTmin(T x,T y){returnx<y?x:y;}template<typenameT>inlineTmax(T x,T y){returnx>y?x:y;}intmain(){read(n);scanf("%s",s);Mx=0;Mn=n;REP(i,0,n-1)sum[s[i]-'0']++;REP(i,1,4)chkmax(Mx,sum[...
const int N = 3e5 + 10; const double eps = 1e-5; vector<int> np[N]; typedef pair<int, int> PII; int n, k; int dfs(int p, int fa, int dep) { int res = 0; if(dep > k / 2) res++; for(int nt : np[p]) { if(nt == fa) continue; res += dfs(nt, p, dep...
逆置换 现在的题面难以下手,因此不妨设\(Q\)为\(P\)的逆置换,即\(Q_{Pi} = i\),于是题面转化为如果\(|Q_i - Q_{i \pm 1}| \geq K\),那么就可以交换\(i\)与\(i \pm 1\)这两个相邻的元素。 我觉得这一点的思想类似于多维偏序的问题,前者是由多维向低维的转化,而本题则是对判断条件...
AtCoder Regular Contest 104 A(语法,构造)Plus Minus 对 构造 问 的中数和到两端的距离 inline void solve() { int A, B; cin >> A >> B;…阅读全文 赞同5 1 条评论 分享收藏 AtCoder Beginner Contest 125 C(思维, gcd)GCD on Blackboard 给定一个序列,可以将其中一个数...
AtCoder Typical Contest 001 https://atcoder.jp/contests/atc001 A - 深さ優先探索 B - Union Find C - 高速フーリエ変換 AtCoder Regular Contest 033 https://atcoder.jp/contests/arc033 A - 隠れた言葉 B - メタ構文変数 C - データ構造 ...
Atcoder Education DP Contest 很好的 Atcoder 的 DP 题单,写一份题解记录一下。 Tasks - Educational DP ContestA Frog 1题意从 1 号点跳到 n 号点,每次可以从 i 跳到 i+1 或者 i+2,若从 i 跳到 j ,其花费为:|h_j-h… Jackl...发表于好题集锦 AtCoder Beginner Contest 406 简易题解,如果...
I think it's actually for Division 2. That's why it is called as Beginner's Contest → Reply Ihave4fish 5 years ago, # ^ | -16 I think it's Div.3, because there are three kinds of regular contests: ABC, ARC, and AGC. → Reply aryanc403 5 years ago, # ^ | +38...
286 0 02:04:03 App AtCoder Regular Contest 166 5题 rk15! 503 0 44:18 App AtCoder Beginner Contest 321 7题 AK rk13 755 2 01:03:18 App AtCoder Beginner Contest 295 1h7题,少个B,rk17 265 0 01:01:32 App AtCoder Beginner Contest 324 7题 AK 550 0 01:08:03 App AtCoder Beginn...
AtCoder Regular Contest 一句话题解因为上篇AGC的写的有点长……估计这篇也短不了所以放个一句话题解方便查阅啥的吧QwQ具体的题意代码题解还是往下翻……ARC 058D:简单容斥计数。E:用二进制表示放的数字,然后状压$DP$。F:$biset$优化$DP$预处理,乱搞贪心。ARC 059D:傻题,存在长的合法子串就一定会存在短...
旅行传送门 题意 给定一个长度为 \(N\) ,正好包含 \(1\) ~ \(N\) 的序列 \(P_1 \cdots P_N\) ,你可以执行以下操作任意次: 选取两个下标 \(i,j\) ,当满足 \(j - i \geq K\) 且 \(|P_i-P_j| = 1\) 时,你可以交换 \(P_