lml11111的博客

http://acm.hdu.edu.cn/showproblem.php?pid=5289 题意： 分组方式是连续的数中最大值和最小值的差小于K，有几种分组方式（不一定用n个数） 分析： 用双向队列进行两边的删除、插入操作，左边的删除操作是不满足小于K的条件就把左边界右移直到满足条件，右边的操作是当是维护最大值是，保证输入的数比前面的数都小，如果前面的数比他小就把他弹出 代码： #...

Problem Description Before the start of contest, there are n ICPC contestants waiting in a long queue. They are labeled by 1 to n from left to right. It can be easily found that the i -th cont...

http://acm.hdu.edu.cn/showproblem.php?pid=6406 Problem Description There is an apple tree in front of Taotao's house. When autumn comes, n apples on the tree ripen, and Taotao will go to pick...

https://nanti.jisuanke.com/t/30991  262144K Feeling hungry, a cute hamster decides to order some take-away food (like fried chicken for only 3030 Yuan). However, his owner CXY thinks that take-away ...

F2. Pictures with Kittens (hard version) time limit per test 2.5 seconds memory limit per test 512 megabytes input standard input output standard output The only difference between easy and h...