随笔分类 -  数据结构 堆

Codeforces Round #443 (Div. 1) C. Tournament
摘要：C. Tournament link http://codeforces.com/contest/878/problem/C description Recently a tournament in k kinds of sports has begun in Berland. Vasya want 阅读全文
posted @ 2017-10-31 17:05 qscqesze 阅读(645) 评论(0) 推荐(0) 编辑
Codeforces Round #407 div2 题解【ABCDE】
摘要：Anastasia and pebbles 题意：你有两种框，每个框可以最多装k重量的物品，但是你每个框不能装不一样的物品。现在地面上有n个物品，问你最少多少次，可以把这n个物品全部装回去。 题解：其实就是问你得用多少次框，然后把多少次除以2就好了。每次装k的物品装回去就好了。 代码： includ 阅读全文
posted @ 2017-03-30 08:48 qscqesze 阅读(653) 评论(1) 推荐(0) 编辑
Codeforces Round #310 (Div. 1) B. Case of Fugitive set
摘要：B. Case of FugitiveTime Limit: 20 SecMemory Limit: 256 MB题目连接http://codeforces.com/contest/555/problem/BDescriptionAndrewid the Android is a galaxy-fa... 阅读全文
posted @ 2015-06-28 01:24 qscqesze 阅读(408) 评论(0) 推荐(1) 编辑
05-树6. Path in a Heap (25) 小根堆
摘要：05-树6. Path in a Heap (25)Time Limit: 20 SecMemory Limit: 256 MB题目连接http://www.patest.cn/contests/mooc-ds2015spring/05-%E6%A0%916DescriptionInsert a s... 阅读全文
posted @ 2015-05-25 21:27 qscqesze 阅读(245) 评论(0) 推荐(0) 编辑
Codeforces Round #296 (Div. 1) A. Glass Carving Set的妙用
摘要：A. Glass Carvingtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputLeonid wants to become a glass c... 阅读全文
posted @ 2015-03-18 13:48 qscqesze 阅读(334) 评论(0) 推荐(0) 编辑
poj 2431 Expedition 贪心+优先队列
摘要：ExpeditionTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 7707Accepted: 2263DescriptionA group of cows grabbed a truck and ventured on an exp... 阅读全文
posted @ 2015-01-25 19:27 qscqesze 阅读(478) 评论(0) 推荐(1) 编辑
poj 2623 Sequence Median 堆的灵活运用
摘要：I - Sequence Median Time Limit:1000MS Memory Limit:1024KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionGiven a sequence of N nonnegative integ... 阅读全文
posted @ 2015-01-24 12:36 qscqesze 阅读(394) 评论(0) 推荐(0) 编辑

点击右上角即可分享
微信分享提示