UniqueColor

2015年9月12日

摘要： Problem DescriptionXiao Ming is a citizen who's good at playing,he has lot's of gold cones which have square undersides,let's call them pyramids.Anyon... 阅读全文

posted @ 2015-09-12 22:09 UniqueColor 阅读(184) 评论(0) 推荐(0) 编辑

hdu 5433 Xiao Ming climbing（bfs+三维标记）

摘要： Problem DescriptionDue to the curse made by the devil,Xiao Ming is stranded on a mountain and can hardly escape.This mountain is pretty strange that i... 阅读全文

posted @ 2015-09-12 22:07 UniqueColor 阅读(237) 评论(0) 推荐(0) 编辑

hdu 4400 Mines（离散化+bfs+枚举）

摘要： Problem DescriptionTerrorists put some mines in a crowded square recently. The police evacuate all people in time before any mine explodes. Now the po... 阅读全文

posted @ 2015-09-12 14:37 UniqueColor 阅读(339) 评论(0) 推荐(0) 编辑

2015年9月11日

hdu 5256 序列变换（LIS最长上升子序列）

摘要： Problem Description我们有一个数列A1,A2...An，你现在要求修改数量最少的元素，使得这个数列严格递增。其中无论是修改前还是修改后，每个元素都必须是整数。请输出最少需要修改多少个元素。Input第一行输入一个T(1≤T≤10)，表示有多少组数据每一组数据：第一行输入一个N(1≤... 阅读全文

posted @ 2015-09-11 21:02 UniqueColor 阅读(195) 评论(0) 推荐(0) 编辑

hdu 5248 序列变换（二分枚举）

摘要： Problem Description给定序列A={A1,A2,...,An}, 要求改变序列A中的某些元素，形成一个严格单调的序列B（严格单调的定义为：Bi 2 #include 3 #include 4 #include 5 #include 6 #include 7 #include 8 us... 阅读全文

posted @ 2015-09-11 20:54 UniqueColor 阅读(275) 评论(0) 推荐(0) 编辑

hdu 3635 Dragon Balls（并查集应用）

摘要： Problem DescriptionFive hundred years later, the number of dragon balls will increase unexpectedly, so it's too difficult for Monkey King(WuKong) to g... 阅读全文

posted @ 2015-09-11 13:18 UniqueColor 阅读(177) 评论(0) 推荐(0) 编辑

poj 3616 Milking Time（dp）

摘要： DescriptionBessie is such a hard-working cow. In fact, she is so focused on maximizing her productivity that she decides to schedule her next N (1 ≤ N... 阅读全文

posted @ 2015-09-11 12:46 UniqueColor 阅读(216) 评论(0) 推荐(0) 编辑

hdu 5335 Walk Out(bfs+寻找路径)

摘要： Problem DescriptionIn an n∗m maze, the right-bottom corner is the exit (position (n,m) is the exit). In every position of this maze, there is either a... 阅读全文

posted @ 2015-09-11 11:26 UniqueColor 阅读(213) 评论(0) 推荐(0) 编辑

2015年9月10日

hdu 5288 OO’s Sequence（计数）

摘要： Problem DescriptionOO has got a array A of size n ,defined a function f(l,r) represent the number of i (li) satisfy ai mod aj=0,now OO want to know∑i=... 阅读全文

posted @ 2015-09-10 22:25 UniqueColor 阅读(201) 评论(0) 推荐(0) 编辑

hdu 5344 MZL's xor（数学之异或）

摘要： Problem DescriptionMZL loves xor very much.Now he gets an array A.The length of A is n.He wants to know the xor of all (Ai+Aj)(1≤i,j≤n)The xor of an a... 阅读全文

posted @ 2015-09-10 21:27 UniqueColor 阅读(212) 评论(0) 推荐(0) 编辑

公告