随笔分类 -  2017多校联合

又是一年多校，加油吧！
hdu 6068--Classic Quotation（kmp+DP）
摘要：题目链接 Problem Description When online chatting, we can save what somebody said to form his ''Classic Quotation''. Little Q does this, too. What's more? 阅读全文
posted @ 2017-09-08 21:24 茶飘香~ 阅读(425) 评论(0) 推荐(0)
hdu 6107--Typesetting(倍增)
摘要：题目链接 Problem Description Yellowstar is writing an article that contains N words and 1 picture, and the i-th word contains ai characters.The page width 阅读全文
posted @ 2017-09-03 12:26 茶飘香~ 阅读(353) 评论(0) 推荐(0)
hdu 6096---String（AC自动机）
摘要：题目链接 Problem Description Bob has a dictionary with N words in it.Now there is a list of words in which the middle part of the word has continuous lett 阅读全文
posted @ 2017-09-02 14:15 茶飘香~ 阅读(333) 评论(0) 推荐(0)
hdu 6161--Big binary tree（思维--压缩空间）
摘要：题目链接 Problem Description You are given a complete binary tree with n nodes. The root node is numbered 1, and node x's father node is ⌊x/2⌋. At the beg 阅读全文
posted @ 2017-09-01 19:42 茶飘香~ 阅读(289) 评论(0) 推荐(0)
hdu 6133---Army Formations(启发式合并+树状数组)
摘要：题目链接 Problem Description > Stormtroopers were the assault/policing troops of the Galactic Empire. Dissenting citizens referred to them as bucketheads, 阅读全文
posted @ 2017-09-01 19:01 茶飘香~ 阅读(291) 评论(0) 推荐(0)
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 茶飘香~ 阅读(243) 评论(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 茶飘香~ 阅读(455) 评论(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 茶飘香~ 阅读(285) 评论(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 茶飘香~ 阅读(312) 评论(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 茶飘香~ 阅读(229) 评论(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 茶飘香~ 阅读(321) 评论(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 茶飘香~ 阅读(406) 评论(0) 推荐(0)
HDU 6044--Limited Permutation（搜索+组合数+逆元）
摘要：题目链接 Problem Description As to a permutation p1,p2,⋯,pn from 1 to n, it is uncomplicated for each 1≤i≤n to calculate (li,ri) meeting the condition tha 阅读全文
posted @ 2017-07-30 11:16 茶飘香~ 阅读(508) 评论(0) 推荐(0)
HDU 6035---Colorful Tree（树形DP）
摘要：题目链接 Problem Description There is a tree with n nodes, each of which has a type of color represented by an integer, where the color of node i is ci.Th 阅读全文
posted @ 2017-07-30 10:36 茶飘香~ 阅读(406) 评论(0) 推荐(0)
HDU 6040---Hints of sd0061(STL)
摘要：题目链接 Problem Description sd0061, the legend of Beihang University ACM-ICPC Team, retired last year leaving a group of noobs. Noobs have no idea how to 阅读全文
posted @ 2017-07-28 15:45 茶飘香~ 阅读(715) 评论(0) 推荐(0)
HDU 6034---Balala Power!（搜索+贪心）
摘要：题目链接 Problem Description Talented Mr.Tang has n strings consisting of only lower case characters. He wants to charge them with Balala Power (he could 阅读全文
posted @ 2017-07-27 19:31 茶飘香~ 阅读(307) 评论(0) 推荐(0)