真正的强者，从不埋怨黎明前的黑暗！！！

摘要： Problem Description Doge, tired of being a popular image on internet, is considering moving to another city for a new way of life. In his country th... 阅读全文

摘要： Problem DescriptionBob is travelling in Xi’an. He finds many secret tunnels beneath the city. In his eyes, the city is a grid. He can’t enter a grid w... 阅读全文

摘要： Problem Description Recently, doge starts to get interested in a strange problem: whether there exists a string A following all the rules below: 1.T... 阅读全文

摘要： Problem Description There are n Doge Planets in the Doge Space. The conqueror of Doge Space is Super Doge, who is going to inspect his Doge Army on al... 阅读全文

摘要： DescriptionVenture MFG Company, Inc. has made a game board. This game board has 15 holes and these holes are filled with pegs except one hole. A peg c... 阅读全文

摘要： 题目大意：求将一个r*c的按钮矩阵由全部为关变成全部为开的最少按扭次数，每按一次开关能作用到的范围不定。题目分析：开关问题。打眼一看就是BFS+位压缩，但是写出来之后TLE。用DFS不断更新最优解。最坏有2^25种情况，加两个剪枝： 一、每一个开关最多只能影响三行，当第now_r-2行仍然有开关关... 阅读全文

摘要： 题目大意：一个鞋匠，有n只鞋要修，修某只鞋的时间ti已知，某只鞋晚修一天要交的罚款fi也已知。现在让找个修鞋顺序使得罚款最少。题目分析：本来想水一下这道题，没想到真的AC啦。后来又查的题解，找的解释。一个比较能说服我的解释是这样的：这个鞋匠不管怎样都要赔本，他每修一只鞋能降低的最大损失是fi/ti，... 阅读全文

摘要： 题目大意：在x轴上，给一些区间，求出能把[0,m]完全覆盖的最少区间个数及该情形下的各个区间。题目分析：简单的区间覆盖问题。可以按这样一种策略进行下去：在所有区间起点、长度有序的前提下，对于当前起点，找到可以覆盖下去的最长区间进行覆盖，并不断更新起点，直到覆盖完所有区间。代码如下：# include... 阅读全文

摘要： DescriptionJohn Doe, a skilled pilot, enjoys traveling. While on vacation, he rents a small plane and starts visiting beautiful places. To save money,... 阅读全文

摘要： 题目大意：已知递推公式和边缘值，求某项的最后m(0 2 # include 3 # include 4 # include 5 using namespace std; 6 struct matrix 7 { 8 int r,c,m[3][3]; 9 matrix(int _r,in... 阅读全文