XDU_PYL的博客

Problem DescriptionYou know YaoYao is fond of his chains. He has a lot of chains and each chain has n diamonds on it. There are two kinds of diamonds, labeled 0 and 1. We can write down the label of

Problem Description Humans have discovered a kind of new metal mineral on Mars which are distributed in point‐like with paths connecting each of them which formed a tree. Now Humans launches k robots

Problem Description You, the leader of Starship Troopers, are sent to destroy a base of the bugs. The base is built underground. It is actually a huge cavern, which consists of many rooms connected wi

http://acm.hdu.edu.cn/showproblem.php?pid=4035经典概率DP。#include #include #include #include #include #include #include #include #include #include using namespace std;const int maxn = 100

DescriptionAfter 4 years' waiting, the game "Chinese Paladin 5" finally comes out. Tomato is a crazy fan, and luckily he got the first release. Now he is at home, ready to begin his journey.Bu

这题，我真草他妈了，一眼就秒的题，我草复测竟然TLE了，我草，早知道我把update改成n,m了，我去，打了这三场比赛我是涨记性了，以后打的时候就得注意细节，细节，细节，细节，。。。。。。。我真草了，好不容易一次上分的机会，我去。。。。。。。。我。。。。。。。。。。。。。#include #include #include #include #include #include

Problem DescriptionOn Saint Valentine's Day, Alex imagined to present a special pendant to his girl friend made by K kind of pearls. The pendant is actually a string of pearls, and its length is def

Problem DescriptionYou have a sequence {a1,a2,...,an} and you can delete a contiguous subsequence of length m. So what is the minimum number of inversions after the deletion. InputTher

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=4542参考了ACdreamer的博客：http://blog.youkuaiyun.com/ACdreamers/article/details/25049767首先对于本题（1）Type = 0即求解约数个数为K结果是一定存在，只不过存在超出范围和不超出范围两种情况，这个与反素数有关，

Problem DescriptionAfter coding so many days,Mr Acmer wants to have a good rest.So travelling is the best choice!He has decided to visit n cities(he insists on seeing all the cities!And he does not

Far away from our world, there is a banana forest. And many lovely monkeys live there. One day, SDH(Song Da Hou), who is the king of banana forest, decides to hold a big party to celebrate Crazy Banan

My name is Hu Bayi, robing an ancient tomb in Tibet. The tomb consists of N rooms (numbered from 1 to N) which are connected by some roads (pass each road should cost some time). There is exactly one r