摘要:
Link. Codeforces Luogu Description. 有 \(n\) 个格子被涂黑,第 \(i\) 个是 \((x_i,y_i)\),对每个 \(x\in[1,n]\),求出恰好包含 \(x\) 个黑格子的 \(k\times k\) 矩形数量。 \(k\le 300\) Solu 阅读全文
![CF685D Kay and Eternity 题解](https://img2020.cnblogs.com/blog/1876751/202110/1876751-20211014204411072-1995511771.png)
摘要:
Link. Codeforces Luogu Flying2018's Solution Solution. Coding. 点击查看代码 //是啊,你就是那只鬼了,所以被你碰到以后,就轮到我变成鬼了{{{ #include<bits/stdc++.h> using namespace std;ty 阅读全文
![CF685C Optimal Point 题解](https://img2020.cnblogs.com/blog/1876751/202110/1876751-20211014190231749-1093447494.png)
摘要:
Link. ATcoder Luogu Description. 给定 \(m\) 个长度不超过 \(n(n\le 20)\) 的 01 串。 找到字典序最小的字符,使它是至少 \(K\) 个字符串的子序列。 Solution. 首先考虑一个暴力做法,\(dp_{S,T}\) 表示当前答案字符串是 阅读全文
![AT3963 [AGC024F] Simple Subsequence Problem 题解](https://img2020.cnblogs.com/blog/1876751/202110/1876751-20211016132327317-863233618.png)
摘要:
Link. ATcoder Luogu Description. 给定 \(n,k,m\),统计序列序列数 \(\{A_i(i\in[0,n])\}\),使得 \(\text{size}(A_i)=i\) \(\forall i\in[1,n],j\in[1,i],A_i(j)\in[1,k]\) 阅读全文
![AT3962 [AGC024E] Sequence Growing Hard 题解](https://img2020.cnblogs.com/blog/1876751/202110/1876751-20211014074813289-869523765.png)