优先队列
oopslb
这个作者很懒,什么都没留下…
展开
-
hdu 5700 区间交 (线段树或优先队列)
区间交Time Limit: 8000/4000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1423 Accepted Submission(s): 543 Problem Description小A有一个含有n个非负整数的数列与m个区间。每个区间可以表示...原创 2018-07-18 14:10:52 · 149 阅读 · 0 评论 -
poj1862 Stripies (优先队列)
StripiesTime Limit: 1000MS Memory Limit: 30000K Total Submissions: 17560 Accepted: 7918 DescriptionOur chemical biologists have invented a new very useful form of life called s...原创 2017-07-19 15:44:45 · 169 阅读 · 0 评论 -
poj 3253 Fence Repair (优先队列)
Fence RepairTime Limit: 2000MS Memory Limit: 65536K Total Submissions: 50548 Accepted: 16582 DescriptionFarmer John wants to repair a small length of the fence around the pastu...原创 2017-07-19 15:11:09 · 149 阅读 · 0 评论 -
poj 3614 Sunscreen (优先队列)
SunscreenTime Limit: 1000MS Memory Limit: 65536K Total Submissions: 8996 Accepted: 3158 DescriptionTo avoid unsightly burns while tanning, each of the C (1 ≤ C ≤ 2500) cows mus...原创 2017-07-19 14:29:32 · 258 阅读 · 0 评论 -
hdu 4857 逃生 (优先队列)
逃生 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 5374 Accepted Submission(s): 1567 Problem Description 糟糕的事情发生...原创 2017-07-19 11:42:07 · 168 阅读 · 0 评论 -
hdu 4546 比赛难度 (优先队列)
http://acm.hdu.edu.cn/showproblem.php?pid=4546思路:建立一个结构体记录一下当前总和、下一总和、当前位置;然后在进行加的时候要有两种,一种是跳过这个数加,另一种是不跳过加,这样就不会漏掉了。#include <iostream>#include <stdio.h>#include <string.h>#...原创 2017-07-19 09:57:45 · 245 阅读 · 0 评论 -
hdu 5818 Joint Stacks (优先队列)
Joint Stacks Time Limit: 8000/4000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1834 Accepted Submission(s): 824 Problem DescriptionA stack is a d...原创 2017-07-19 09:56:57 · 132 阅读 · 0 评论 -
hdu 1509 Windows Message Queue (优先队列)
http://acm.hdu.edu.cn/showproblem.php?pid=1509思路:这题排序条件是第二个数小的在前面,如果一样的话先输入的排在前头,然后输出字符串和第一个数;代码:#include <iostream>#include <stdio.h>#include <string.h>#include <algori...原创 2017-07-18 11:14:09 · 215 阅读 · 0 评论 -
hdu 1873 看病要排队 (优先队列)
http://acm.hdu.edu.cn/showproblem.php?pid=1873思路:这题使用优先队列可以解决,优先级高的在前面如果一样就按排队号晓得排列,这里需要开个优先队列数组来记录;代码:#include <iostream>#include <stdio.h>#include <string.h>#include <...原创 2017-07-18 17:40:38 · 216 阅读 · 0 评论 -
2018中国大学生程序设计竞赛 - 网络选拔赛 1001 Buy and Resell (贪心+优先队列)
http://acm.hdu.edu.cn/showproblem.php?pid=6438 题意:有n个城市,你可以在一个城市买一个东西,也可以卖一个东西,也可以不买不卖,然后问获得的最大利润和最小操作数。 思路:这个博主的文章写的很详细 代码:#include<bits/stdc++.h>using namespace std;#defin...原创 2018-08-27 14:57:30 · 155 阅读 · 0 评论