08 2017 档案

hdu 6171---Admiral(双向搜索)
摘要：题目链接 Problem Description Suppose that you are an admiral of a famous naval troop. Our naval forces have got 21 battleships. There are 6 types of battl 阅读全文
posted @ 2017-08-29 14:19 茶飘香~ 阅读(237) 评论(0) 推荐(0)
HDU 6170----Two strings（DP）
摘要：题目链接 Problem Description Giving two strings and you should judge if they are matched.The first string contains lowercase letters and uppercase letters 阅读全文
posted @ 2017-08-24 10:17 茶飘香~ 阅读(453) 评论(0) 推荐(1)
hdu 6086 -- Rikka with String(AC自动机 + 状压DP)
摘要：题目链接 Problem Description As we know, Rikka is poor at math. Yuta is worrying about this situation, so he gives Rikka some math tasks to practice. Ther 阅读全文
posted @ 2017-08-21 20:56 茶飘香~ 阅读(283) 评论(0) 推荐(0)
hdu 6125 -- Free from square(状态压缩+分组背包)
摘要：题目链接 Problem Description There is a set including all positive integers that are not more then n. HazelFan wants to choose some integers from this set 阅读全文
posted @ 2017-08-21 20:09 茶飘香~ 阅读(309) 评论(0) 推荐(0)
hdu 6127---Hard challenge（思维）
摘要：题目链接 Problem Description There are n points on the plane, and the ith points has a value vali, and its coordinate is (xi,yi). It is guaranteed that no 阅读全文
posted @ 2017-08-15 21:29 茶飘香~ 阅读(228) 评论(0) 推荐(0)
hdu 6121---Build a tree（深搜+思维）
摘要：题目链接 Problem Description HazelFan wants to build a rooted tree. The tree has n nodes labeled 0 to n−1, and the father of the node labeled i is the nod 阅读全文
posted @ 2017-08-15 21:04 茶飘香~ 阅读(318) 评论(0) 推荐(0)
HDU 6097---Mindis(二分)
摘要：题目链接 Problem Description The center coordinate of the circle C is O, the coordinate of O is (0,0) , and the radius is r.P and Q are two points not out 阅读全文
posted @ 2017-08-10 20:17 茶飘香~ 阅读(341) 评论(3) 推荐(0)
hdu 6093---Rikka with Number(计数)
摘要：题目链接 Problem Description As we know, Rikka is poor at math. Yuta is worrying about this situation, so he gives Rikka some math tasks to practice. Ther 阅读全文
posted @ 2017-08-08 21:18 茶飘香~ 阅读(400) 评论(0) 推荐(0)
hdu 6049---Sdjpx Is Happy(区间DP+枚举)
摘要：题目链接 Problem Description Sdjpx is a powful man,he controls a big country.There are n soldiers numbered 1~n(1<=n<=3000).But there is a big problem for 阅读全文
posted @ 2017-08-06 20:40 茶飘香~ 阅读(381) 评论(0) 推荐(0)
hdu 6058---Kanade's sum（链表）
摘要：题目链接 Problem Description Give you an array A[1..n]of length n. Let f(l,r,k) be the k-th largest element of A[l..r].Specially , f(l,r,k)=0 if r−l+1<k.G 阅读全文
posted @ 2017-08-05 10:52 茶飘香~ 阅读(316) 评论(0) 推荐(0)
hdu 6059---Kanade's trio(字典树)
摘要：题目链接 Problem Description Give you an array A[1..n]，you need to calculate how many tuples (i,j,k) satisfy that (i<j<k) and ((A[i] xor A[j])<(A[j] xor A 阅读全文
posted @ 2017-08-05 10:36 茶飘香~ 阅读(434) 评论(0) 推荐(0)