贪心
欧莎
啦啦啦,啦啦啦,让我们一起洗刷刷
展开
-
hdu 2037 今年暑假不AC
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others Problem Description “今年暑假不AC?” “是的。” “那你干什么呢?” “看世界杯呀,笨蛋!” “@#$%^&*%…”确实如此,世界杯来了,球迷的节日也来了,估计很多ACMer也会抛开电脑,奔向电视了。原创 2016-07-10 08:24:53 · 215 阅读 · 0 评论 -
poj 1064 Cable master(二分+贪心+分数化整数)
Total Submissions: 42224 Accepted: 9054DescriptionInhabitants of the Wonderland have decided to hold a regional programming contest. The Judging Committee has volunteered and has promise原创 2017-03-02 15:47:36 · 286 阅读 · 0 评论 -
poj 3258 River Hopscotch (最小值最大化 二分+贪心)
Every year the cows hold an event featuring a peculiar version of hopscotch that involves carefully jumping from rock to rock in a river. The excitement takes place on a long, straight river with a ro原创 2017-03-02 08:58:41 · 365 阅读 · 0 评论 -
田忌赛马 poj 2287 (贪心,动态规划,贪心+动态规划)
题目链接贪心 ;1:如果田忌的最快马快于齐王的最快马,比一场 2: 如果田忌的最快马慢于齐王的最快马,则用田忌的最慢马和齐王的最快马比赛一场 3: 如果田忌的最快马和齐王的最快马一样快,则比较田忌的最慢马和齐王的最慢马分两种情况 (1) 若田忌的最慢马快于齐王的最慢马,田忌的慢马和齐王的慢马进行比较原创 2017-03-20 21:33:27 · 2296 阅读 · 0 评论 -
Supermarket poj 1456 (贪心,并查集)
DescriptionA supermarket has a set Prod of products on sale. It earns a profit px for each product x∈Prod sold by a deadline dx that is measured as an integral number of time units starting from the原创 2017-03-23 15:42:00 · 266 阅读 · 0 评论 -
HDU 3348 coins 贪心 最少纸币和最多纸币
[题目链接](http://acm.hdu.edu.cn/showproblem.php?pid=3348) coinsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others...原创 2018-03-26 15:34:24 · 561 阅读 · 0 评论 -
nyist 891 找点 区间选点
描述上数学课时,老师给了LYH一些闭区间,让他取尽量少的点,使得每个闭区间内至少有一个点。但是这几天LYH太忙了,你们帮帮他吗?输入多组测试数据。每组数据先输入一个N,表示有N个闭区间(N≤100)。接下来N行,每行输入两个数a,b(0≤a≤b≤100),表示区间的两个端点。输出输出一个整数,表示最少需要找几个点。样例输入41 52 41 42 331...原创 2016-07-25 11:07:28 · 264 阅读 · 0 评论 -
nyist 1030 Yougth's Game[Ⅲ]
描述有一个长度为n的整数序列,A和B轮流取数,A先取,每次可以从左端或者右端取一个数,所有数都被取完时游戏结束,然后统计每个人取走的所有数字之和作为得分,两人的策略都是使自己的得分尽可能高,并且都足够聪明,求A的得分减去B的得分的结果。输入输入包括多组数据,每组数据第一行为正整数n(1<=n<=1000),第二行为给定的整数序列Ai(-1000<=Ai<=100...原创 2016-07-23 18:10:55 · 268 阅读 · 0 评论 -
nyist 15 括号匹配(二)
描述给你一个字符串,里面只包含"(",")","[","]"四种符号,请问你需要至少添加多少个括号才能使这些括号匹配起来。如:[]是匹配的([])[]是匹配的((]是不匹配的([)]是不匹配的输入第一行输入一个正整数N,表示测试数据组数(N<=10)每组测试数据都只有一行,是一个字符串S,S中只包含以上所说的四种字符,S的长度不超过100输出对于每组测试数据都...原创 2016-07-23 13:46:19 · 239 阅读 · 0 评论 -
nyist 737 石子合并(一)
描述 有N堆石子排成一排,每堆石子有一定的数量。现要将N堆石子并成为一堆。合并的过程只能每次将相邻的两堆石子堆成一堆,每次合并花费的代价为这两堆石子的和,经过N-1次合并后成为一堆。求出总的代价最小值。 输入 有多组测试数据,输入到文件结束。 每组测试数据第一行有一个整数n,表示有n堆石子。 接下来的一行有n(0< n <200)个数,分别表示这n堆石子的数目,用空格隔开 输出原创 2016-07-23 08:29:23 · 272 阅读 · 0 评论 -
贪心 区间覆盖问题
问题描述:给定一个长度为m的区间,再给出n条线段的起点和终点(注意这里是闭区间),求最少使用多少条线段可以将整个区间完全覆盖样例:区间长度8,可选的覆盖线段[2,6],[1,4],[3,6],[3,7],[6,8],[2,4],[3,5]解题过程:1将每一个区间按照左端点递增顺序排列,拍完序后为[1,4],[2,4],[2,6],[3,5],[3,6],[3,7],[6,8]2设置一个变量表示已经覆原创 2016-07-26 10:45:10 · 1079 阅读 · 0 评论 -
乘船问题(贪心小白书)
有n个人,第i个人重量为wi,每艘船的最大载重量均为C ,且最多只能乘两个人,用最少的船装载所以的人。 #include<cstdio>#include<cstring>#include<cmath>#include<cstdlib>#include<string>#include<set>...原创 2016-08-03 10:26:04 · 1419 阅读 · 0 评论 -
Codeforces Round #380 D. Sea Battle (思维题)
Galya is playing one-dimensional Sea Battle on a 1 × n grid. In this game a ships are placed on the grid. Each of the ships consists of bconsecutive cells. No cell can be part of two ships, however,原创 2016-11-25 20:57:30 · 304 阅读 · 0 评论 -
lightoj 1198(贪心)
Description Your karate club challenged another karate club in your town. Each club enters N players into the match, and each player plays one game against a player from the other team. Each game that原创 2016-08-08 15:07:40 · 225 阅读 · 0 评论 -
hdu 5783 Divide the Sequence
Problem Description Alice has a sequence A, She wants to split A into as much as possible continuous subsequences, satisfying that for each subsequence, every its prefix sum is not small than 0.Input原创 2016-08-03 10:38:13 · 360 阅读 · 0 评论 -
hdu 2570 迷瘴
迷瘴Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 6088 Accepted Submission(s): 2073Problem Description 通过悬崖的yifenfei,又面临着幽谷的考验—— 幽谷周围瘴气弥漫,原创 2016-07-10 13:21:34 · 241 阅读 · 0 评论 -
poj 2376 Cleaning Shifts 区间覆盖
Cleaning Shifts Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 17106 Accepted: 4366 DescriptionFarmer John is assigning some of his N (1 <= N <= 25,000) cows to do some clean原创 2016-07-10 17:26:06 · 447 阅读 · 0 评论 -
hdu 2178 悼念512汶川大地震遇难同胞――老人是真饿了
对于幸存的灾民来说,最急待解决的显然是温饱问题,救灾部队一边在组织人员全力打通交通,一边在组织采购粮食。现在假设下拨了一定数量的救灾经费要去市场采购大米(散装)。如果市场有m种大米,各种大米的单价和重量已知,请问,为了满足更多灾民的需求,最多能采购多少重量的大米呢?Input 输入数据首先包含一个正整数C,表示有C组测试用例,每组测试用例的第一行是两个整数n和m(0#include<stdio.h原创 2016-07-12 14:33:30 · 418 阅读 · 0 评论 -
hdu 1050 Moving Tables
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Problem Description The famous ACM (Advanced Computer Maker) Company has rented a floor of a building whose shape i原创 2016-07-12 15:02:55 · 220 阅读 · 0 评论 -
poj 1328 Radar Installation (区间选点)
Description Assume the coasting is an infinite straight line. Land is in one side of coasting, sea in the other. Each small island is a point locating in the sea side. And any radar installation, loca原创 2016-07-25 09:24:50 · 220 阅读 · 0 评论 -
hdu 2391
DescriptionThey say that in Phrygia, the streets are paved with gold. You’re currently on vacation in Phrygia, and to your astonishment you discover that this is to be taken literally: small heaps原创 2016-07-26 09:23:57 · 495 阅读 · 0 评论 -
HDU 1009 FatMouse' Trade
FatMouse' TradeTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Problem Description FatMouse prepared M pounds of cat food, ready to trade with the cats guarding原创 2016-07-09 14:09:17 · 198 阅读 · 0 评论 -
sequence
sequence Time Limit:1000MS Memory Limit:65536KDescription 将一个给定的数列,拆分成K个不降序列,每个数出现且只出现一次,且在各序列中各个数相对原数列的相对顺序不变。如7 6 9 8 10 可以拆分7 9 10和6 8。求最小的K值。 Input 第一行输入一个整数T(1<=T<=100),表示接下来T组测试数据,每组两原创 2016-07-09 14:13:04 · 383 阅读 · 0 评论 -
HDU 1257 最少拦截系统
最少拦截系统Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Problem Description 某国为了防御敌国的导弹袭击,发展出一种导弹拦截系统.但是这种导弹拦截系统有一个缺陷:虽然它的第一发炮弹能够到达任意的高度,但是以后每一发炮弹都不能超过前一发的高度.某天,雷达捕捉原创 2016-07-09 14:16:40 · 209 阅读 · 0 评论 -
HUD 1049 Climbing Worm
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Problem Description An inch worm is at the bottom of a well n inches deep. It has enough energy to climb u inches e原创 2016-07-09 15:41:25 · 312 阅读 · 0 评论 -
hdu 1051 Wooden Sticks
Wooden SticksTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 17650 Accepted Submission(s): 7229Problem Description There is a pile of n woo原创 2016-07-09 18:10:48 · 194 阅读 · 0 评论 -
hdu 5835 Danganronpa
题目链接题意:可能我感觉题我都读了两遍了,还感觉我是不是,题意理解错了,因为当时很蒙,所以也是没有思路,我就没有做这道题,后来我没有看队友A了,我就感觉应该不难吧,就是n种礼物,每种礼物就a[i]个,让满足每个人都有一个神秘礼物和普通礼物,并且相邻的桌子上不能放同一种的礼物,神秘礼物没限制,礼物是连续的放的,问最多可以有所少人得到礼物。思路:我们可以很容易的发现,很多结果都是sum/2,但是并不是都原创 2016-08-15 17:19:19 · 431 阅读 · 0 评论 -
选择不相交区间问题 (贪心)
数轴上有n个开区间(ai,bi),选择尽量多个区间,使得这些区间两两没有公共点。#include<stdio.h>#include<iostream>#include<string.h>#include<algorithm>using namespace std;int n;struct node{ int l; int r;}ss[1000];int cmp(no原创 2016-08-03 10:30:27 · 800 阅读 · 0 评论