摘要:
CF 616 div1 A 题解 若 k \geq m 1 ,我们可以任意指定顺序,我们求每个方案的最大值即可。 若 $k include include include define ll long long using namespace std; int read() { int k=0, 阅读全文
摘要:
CF 612 div1 三道大水题 A 题解 dp,用 f[i][j][0/1] 表示到第 i 个空格且一共填了 j 个奇数,末尾为奇数或偶数的最小值 转移见代码 ~~~cpp include include include include define ll long long us 阅读全文