![](https://img-blog.csdnimg.cn/20201014180756925.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
dfs
_not
这个作者很懒,什么都没留下…
展开
-
hdu 1027 Ignatius and the Princess II (dfs+剪枝)?
Ignatius and the Princess IITime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 8727 Accepted Submission(s): 5135Problem Description Now our he转载 2017-09-09 10:09:47 · 176 阅读 · 0 评论 -
poj 3842 An Industrial Spy(dfs+乱搞)
An Industrial SpyTime Limit: 1000MS Memory Limit: 65536K Total Submissions: 1733 Accepted: 684 DescriptionIndustrial spying is very common for modern research labs. I am such an industrial s原创 2017-09-15 20:55:28 · 420 阅读 · 0 评论 -
2018 Multi-University Training Contest 5 B
hdu 6351 Beautiful Now给一个数n,在m次交换位置(可以自己和自己swap)之后,分别求出得到的最小值和最大值。(X)贪心:min(每次把右边最小的值与最前面比它大的值交换)max(每次把最右边最小的值与最前面比它小的值交换)最后特判右边交换到左边的值如果一样,那么交换到右边的值按小到大排列(大到小排列)太年轻ac做法:dfs+剪枝 || 根据全排列求(...原创 2018-08-07 10:43:30 · 118 阅读 · 0 评论