目录
- 4.14-[SCOI2010]股票交易—DP+单调队列优化
- 4.13-牛牛的木板—标记or尺取
- [4.12-D. Min Cost String—构造](https://codeforces.com/contest/1511/problem/D)
- [4.11-E. Permutation by Sum—暴力+思维](https://codeforces.com/contest/1512/problem/E)
- [4.10-D. Binary String To Subsequences—STL+思维](https://codeforces.com/contest/1399/problem/D)
- 4.9-不降数—矩阵快速幂
- [4.8-A Simple Task—线段树](https://ac.nowcoder.com/acm/problem/111013)
- [4.7-No Change—状压DP+二分](https://ac.nowcoder.com/acm/problem/24416)
4.14-[SCOI2010]股票交易—DP+单调队列优化
// Problem: [SCOI2010]股票交易
// Contest: NowCoder
// URL: https://ac.nowcoder.com/acm/problem/20280
参考题解:https://blog.nowcoder.net/n/1dec7f3c241645e7bc060cf1dfae1b31
参考代码:https://ac.nowcoder.com/acm/contest/view-submission?submissionId=47434368
4.13-牛牛的木板—标记or尺取
有m次消去黑块的机会,问消去后最长连续白块长度
// Problem: 牛牛的木板
// Contest: NowCoder
// URL: https://ac.nowcoder.com/acm/problem/204370
标记法:存下每个黑块位置,单条语句更新
尺取法:左侧是一步一步延伸,右侧按最大黑块数不超过m进行缩短
4.12-D. Min Cost String—构造
构造出一个最大不重边图,任意两点间都有且只有一条有向边,另外自环也算一次
// Problem: D. Min Cost String
// Contest: Codeforces
// URL: https://codeforces.com/contest/1511/problem/D
4.11-E. Permutation by Sum—暴力+思维
n个数的排列,取k个数使其和正好为s
先把k位数填上最小的k个(1~k),再将剩余需要值依次填满它们
// Problem: E. Permutation by Sum
// Contest: Codeforces
// URL: https://codeforces.com/contest/1512/problem/E
4.10-D. Binary String To Subsequences—STL+思维
需要尽可能长的01交替出现,保留前一次的状态进行操作
// Problem: D. Binary String To Subsequences
// Contest: Codeforces
// URL: https://codeforces.com/contest/1399/problem/D
代码1:
代码2:
4.9-不降数—矩阵快速幂
// Problem: 不降数
// Contest: NowCoder
// URL: https://ac.nowcoder.com/acm/contest/11170/C
4.8-A Simple Task—线段树
对于每次【L,R】修改,把区间内所有字母个数获取,再按标记把整个区间字母覆盖向下更新至叶节点
// Problem: A Simple Task
// Contest: NowCoder
// URL: https://ac.nowcoder.com/acm/problem/111013
4.7-No Change—状压DP+二分
枚举当前状态,枚举状态下未使用的硬币,贪心二分查找最大覆盖长度,更新
// Problem: No Change
// Contest: NowCoder
// URL: https://ac.nowcoder.com/acm/problem/24416