- 博客(4)
- 收藏
- 关注
RSS订阅原创 Codeforces 892E - Envy 【最小生成树】
Codeforces 892E - Envy 【最小生成树】 For a connected undirected weighted graph G, MST (minimumspanning tree) is a subgraph of G that contains all of G's vertices, isa tree, and sum of its edges is minimum possible. You are given agraph G. If you run a MST algor
2017-12-19 21:13:41
917
原创 Codeforces 899D - Shovel Sale 【思维】
Codeforces 899D - Shovel Sale 【思维】 There are n shovels in Polycarp's shop. The i-th shovel costs i burles, thatis, the first shovel costs 1 burle, thesecond shovel costs 2 burles, the thirdshovel costs 3 burles, and so on.Polycarps wants to sell shovels in
2017-12-17 16:50:22
1040
原创 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
986
原创 Codeforces 900C - Remove Extra One 【树状数组】
Codeforces 900C - Remove Extra One 【树状数组】 You are given apermutation p of length n. Remove one element from permutation to make the number of records themaximum possible. We remind thatin a sequence of numbers a1, a2, ..., ak the element ai is a record if
2017-12-12 16:53:01
594
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人