
贪心
Dust_Heart
这个作者很懒,什么都没留下…
展开
-
POJ 1716 Integer Intervals(差分约束)
Integer Intervals Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 14689 Accepted: 6226 Description An integer interval [a,b], a Wri原创 2017-06-03 02:15:47 · 2428 阅读 · 1 评论 -
Codeforces 913D - Too Easy Problems 【优先队列】
Codeforces 913D - Too Easy Problems 【优先队列】 You are preparing for an exam onscheduling theory. The exam will last for exactly T millisecondsand will consist of n problems. You can either solve problem i in exactly ti milliseconds orignore it and spend no ti原创 2018-01-09 09:49:25 · 860 阅读 · 0 评论 -
Codeforces 898E - Squares and not squares 【优先队列贪心】
Codeforces 898E - Squares and not squares 【优先队列贪心】 Ann and Boryahave n piles with candies and n is even number. There are ai candies in pile with number i. Ann likesnumbers which are square of some integer and Borya doesn't like numbers whichare square o原创 2017-12-17 00:32:13 · 1027 阅读 · 0 评论 -
Codeforces 864D - Make a Permutation! 【贪心】
Codeforces 864D - Make a Permutation! 【贪心】 Ivan has an array consisting of n elements. Each of the elements is aninteger from 1 to n. Recently Ivan learned about permutations and theirlexicographical order. Now he wants to change (replace) minimum number原创 2017-09-25 21:26:21 · 1055 阅读 · 0 评论 -
Codeforces 853B - Jury Meeting 【贪心】
Codeforces 853B - Jury Meeting 【贪心】 Country of Metropolia is holding Olympiad of Metrpolises soon.It mean that all jury members of the olympiad should meet together inMetropolis (the capital of the country) for the problem preparation process. There are原创 2017-09-07 01:18:43 · 1098 阅读 · 0 评论 -
2017 Multi-University Training Contest 10 && HDU 6178 Monkeys 【贪心||树形DP】
2017 Multi-University Training Contest 10 && HDU 6178 Monkeys 【贪心||树形DP】 There is a tree having N vertices. In the tree there are K monkeys (K <= N). A vertex can be occupied by at most one monkey. They want to remove some edges and leave minimum edges, b原创 2017-08-25 21:01:46 · 496 阅读 · 0 评论 -
2017 Multi-University Training Contest 1 && HDOJ 6034 Balala Power! 【贪心】
2017 Multi-University Training Contest && HDOJ 6034 Balala Power! 【贪心】 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 from a to z into each number ra原创 2017-07-25 20:36:26 · 648 阅读 · 0 评论 -
Codeforces 426C - Sereja and Swaps 【优先队列||DP】
Codeforces 426C - Sereja and Swaps 【优先队列||DP】 Codeforces Round #243 (Div. 2) 给定一个长度为 n 的序列 a1,an,...,an,你有 k 次机会选择 一个 x 和 y(1 ≤x < y≤n),交换 ax 和 ay。 k 次机会不一定要全部用完,你需要操作完之后选择一个区 间 [l,r] 使得 al +al+1 + ... +ar 最大。 As usual, Sereja has array a, its elementsare原创 2018-03-27 16:27:39 · 383 阅读 · 0 评论