- 博客(24)
- 收藏
- 关注
RSS订阅原创 CF #425 DIV2 D. Misha, Grisha and Underground（LCA）
D. Misha, Grisha and Underground Misha and Grisha are funny boys, so they like to use new underground. The underground has n stations connected with n - 1 routes so that each route connects t
2017-09-13 20:12:17
369
原创 HDU 6201 transaction transaction transaction（网络流+最短路）
transaction transaction transaction Problem Description Kelukin is a businessman. Every day, he travels around cities to do some business. On August 17th, in memory of a great man, citizens will r
2017-09-12 12:39:57
331
原创 HDU 6053 TrickGCD（莫比乌斯反演）
TrickGCD Problem Description You are given an array A , and Zhu wants to know there are how many different array B satisfy the following conditions? * 1≤Bi≤Ai * For each pair( l , r ) (1≤l≤r≤n
2017-09-07 15:18:04
366
原创 HDU 6058 Kanade's sum（思维）
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 Give you k , you need to calcula
2017-09-06 10:20:41
347
原创 HDU 5961 传递（BFS）
传递 Problem Description 我们称一个有向图G是传递的，当且仅当对任意三个不同的顶点a,,若G中有 一条边从a到b且有一条边从b到c ,则G中同样有一条边从a到c。 我们称图G是一个竞赛图，当且仅当它是一个有向图且它的基图是完全图。换句 话说，将完全图每条边定向将得到一个竞赛图。 下图展示的是一个有4个顶点的竞赛图。 现在，给你两个有向图P =
2017-09-04 12:10:51
441
原创 HDU 6073 Matching In Multiplication（拓扑+思维）
Matching In Multiplication Problem Description In the mathematical discipline of graph theory, a bipartite graph is a graph whose vertices can be divided into two disjoint sets U and V (that is, U a
2017-08-27 16:04:30
397
原创 HDU 6070 Dirt Ratio（二分+线段树）
Dirt Ratio Problem Description In ACM/ICPC contest, the ''Dirt Ratio'' of a team is calculated in the following way. First let's ignore all the problems the team didn't pass, assume the team pas
2017-08-26 20:04:32
419
原创 HDU 6105 Gameia（博弈+二分匹配）
Gameia Problem Description Alice and Bob are playing a game called 'Gameia ? Gameia !'. The game goes like this : 0. There is a tree with all node unpainted initial. 1. Because Bob is the VIP play
2017-08-23 16:29:16
363
原创 HDU 6129 Just do it（递推）
Just do it Problem Description There is a nonnegative integer sequence a1...n of length n. HazelFan wants to do a type of transformation called prefix-XOR, which means a1...n changes into b1...n,
2017-08-23 13:10:55
474
1
原创 HDU 6162 Ch’s gift（LCA）
Ch’s gift Problem Description Mr. Cui is working off-campus and he misses his girl friend very much. After a whole night tossing and turning, he decides to get to his girl friend's city and of cours
2017-08-23 09:23:02
489
原创 HDU 6126 Give out candies（最小割）
Give out candies Problem Description There are n children numbered 1 to n, and HazelFan's task is to give out candies to the children. Each children must be given at least 1 and at most m candies.
2017-08-21 18:06:28
377
原创 HDU 6134 Battlestation Operational（莫比乌斯反演+线性筛）
Battlestation Operational Input There are multiple test cases. Each line of the input, there is an integer n (1≤n≤106), as described in the problem. There are up to 104 test cases. Output
2017-08-20 15:43:42
452
原创 HDU 6143 Killer Names（容斥）
Killer Names Problem Description > Galen Marek, codenamed Starkiller, was a male Human apprentice of the Sith Lord Darth Vader. A powerful Force-user who lived during the era of the Galactic E
2017-08-18 16:33:09
341
原创 HDU 6140 Hybrid Crystals（思维）
Hybrid Crystals Problem Description Given n crystals' energy levels ai and types bi (1≤i≤n), bi=N means the i-th crystal is a neutral one, bi=L means a Light one, and bi=D means
2017-08-18 10:15:42
853
原创 HDU 6127 Hard challenge（几何）
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 two points have the same coordinate
2017-08-15 19:56:06
317
原创 HDU 6119 小小粉丝度度熊（尺取）
小小粉丝度度熊 Problem Description 度度熊喜欢着喵哈哈村的大明星——星星小姐。 为什么度度熊会喜欢星星小姐呢？ 首先星星小姐笑起来非常动人，其次星星小姐唱歌也非常好听。 但这都不是最重要的，最重要的是，星星小姐拍的一手好代码！ 于是度度熊关注了星星小姐的贴吧。 一开始度度熊决定每天都在星星小姐的贴吧里面签到。 但是度度熊是一个非常
2017-08-15 09:34:09
330
原创 HDU 6103 Kirinriki（尺取）
Kirinriki Problem Description We define the distance of two strings A and B with same length n is disA,B=∑i=0n−1|Ai−Bn−1−i| The difference between the two characters is defined as the difference i
2017-08-11 15:29:41
370
原创 HDU 6097 Mindis（几何）
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 outside the circle, and PO = QO. You need to
2017-08-11 14:10:34
424
原创 HDU 6092 Rikka with Subset（背包+思维）
Rikka with Subset 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. There is one of them: Yuta ha
2017-08-09 15:01:34
375
原创 HDU 6090 Rikka with Graph（思维）
Rikka with Graph 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. There is one of them:
2017-08-09 14:00:22
484
原创 HDU 4927 Series 1（大数+杨辉三角）
Series 1 Problem Description Let A be an integral series {A1, A2, . . . , An}. The zero-order series of A is A itself. The first-order series of A is {B1, B2, . . . , Bn-1},where Bi = Ai
2017-08-07 10:41:19
571
原创 HDU 6034 Balala Power!（贪心）
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 change each character ranged
2017-08-07 10:26:55
309
原创 HDU 6082 度度熊与邪恶大魔王（动态规划）
度度熊与邪恶大魔王 Problem Description 度度熊为了拯救可爱的公主，于是与邪恶大魔王战斗起来。 邪恶大魔王的麾下有n个怪兽，每个怪兽有a[i]的生命值，以及b[i]的防御力。 度度熊一共拥有m种攻击方式，第i种攻击方式，需要消耗k[i]的晶石，造成p[i]点伤害。 当然，如果度度熊使用第i个技能打在第j个怪兽上面的
2017-08-07 10:09:41
573
原创 HDU 6069 Counting Divisors（数学）
Counting Divisors Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 524288/524288 K (Java/Others) Total Submission(s): 2762 Accepted Submission(s): 1021 Problem Description In mathem
2017-08-06 21:25:17
324
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人