贪心
文章平均质量分 54
G_rass
这个作者很懒,什么都没留下…
展开
-
Gold Rush
DescriptionInputOutputSample Input32 2 22 1 310 1000 24Sample Output127HINTSource贪心算法,注意变量在作用域中值的变化#include#includeusing namespace std;原创 2015-07-09 17:14:47 · 846 阅读 · 0 评论 -
uva 10954 Add All
Yup!! The problem name reflects your task; just add a set of numb ers. But you may feel yourselvescondescended, to write a C/C++ program just to add a set of numb ers. Such a problem w原创 2015-08-13 21:54:42 · 460 阅读 · 0 评论 -
coj1098: Happy watering
思路:采用贪心的策略,每次都选择最矮的书浇水,高度差为0时或k次浇水后结束,每次更新最短距离#include #include #include #include #include using namespace std;struct note{ int h,d; bool operator < (const struct note &tmp)const {原创 2016-01-13 16:04:14 · 379 阅读 · 0 评论 -
coj1254: 开机
思路:从第二台机器开始排序,每次都先开启时间最长的,并及时更新最大值#include #include #include #include int a[100000];using namespace std;int main(){ //freopen("in.txt","r",stdin); int n ; while(scanf("%d",&n)!=EOF) { f原创 2016-01-14 02:16:23 · 408 阅读 · 0 评论