joj acm_贪心
文章平均质量分 63
kongming_acm
kongming_acm
展开
-
2170: Travel 活动安排问题
2170: TravelResultTIME LimitMEMORY LimitRun TimesAC TimesJUDGE3s8192K422145StandardMike want to travel around in the holiday, so he found some info. The travel starts at the time S and ends at F. Mike want to do more tavelling without any conflicts in time原创 2010-07-10 22:07:00 · 398 阅读 · 0 评论 -
joj 1966 Super Market III 带期限的作业排序
<br /> <br />A 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 moment the sale begins. Each product takes precisely on原创 2011-04-29 19:23:00 · 827 阅读 · 0 评论 -
poj 1018 Communication System 贪心
<br />Communication SystemTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 14261 Accepted: 4993<br />DescriptionWe have received an order from Pizoor Communications Inc. for a special communication system. The system consists of several devices. F原创 2011-02-27 15:15:00 · 639 阅读 · 0 评论 -
poj 1328 Radar Installation 已知一定数量的区间,求最小数量的点,使得每个区间内斗至少存在一个点 贪心
Radar InstallationTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 23954 Accepted: 5130DescriptionAssume the coasting is an infinite straight line. Land is in one side of coasting, sea in the other. Each small island is a point locatin原创 2011-02-25 16:49:00 · 959 阅读 · 0 评论 -
tyvj 1019 配对 给出2个序列A={a[1],a[2],…,a[n]},B={b[1],b[2],…,b[n]},从A、B中各选出n个元素进行一一配对(可以不按照原来在序列中的顺序),并使得所有配对元素差的绝对值之和最大。
FromAdmin☆配对 背景 Background 太原成成中学第2次模拟赛 第二道 描述 Description 给出2个序列A={a[1],a[2],…,a[n]},B={b[1],b[2],…,b[n]},从A、B中各选出n个元素进行一一配对(可以不按照原来在序列中的顺序),并使得所有配对元素差的绝对值之和最大。 输入格式 Input Format 输入的第1行为1个整数n<br />第2行包含n个整数,题目中的A序列。 <br />第3行原创 2010-10-29 20:39:00 · 4873 阅读 · 0 评论 -
tyvj 1032 零用钱 给定硬币的集合,每次至少给某数目,问最多能支付多少个次。
FromAdmin☆零用钱 背景 Background USACO OCT09 7TH 描述 Description 作為创造產奶纪录的回报,Farmer John决定开始每个星期给Bessie一点零花钱。<br /><br />FJ有一些硬币,一共有N (1 <= N <= 20)种不同的面额。每一个面额都能整除所有比它大的面额。<br /><br />他想用给定的硬币的集合,每个星期至少给Bessie某个零花钱的数目C (1 <= C <= <br />10000原创 2010-10-25 20:51:00 · 1481 阅读 · 0 评论 -
hdu Priest John's Busiest Day 活动安排问题变形 只取一半时间
Priest John's Busiest DayTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 350 Accepted Submission(s): 79Problem DescriptionJohn is the only priest in his town. October 26th is the John's busiest day原创 2010-09-22 11:01:00 · 934 阅读 · 0 评论 -
hdu 3650 Hot Expo 活动安排 共多少天能参观完
Hot ExpoTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Problem DescriptionSunny wants to go to the Shanghai Expo this month and he intends to visit n (1原创 2010-09-22 09:07:00 · 697 阅读 · 0 评论 -
2518: No overlap 活动安排变形
<br />2518: No overlap<br />--------------------------------------------------------------------------------<br />Result TIME Limit MEMORY Limit Run Times AC Times JUDGE <br /> 1s 8192K 163 46 Standard <br />Give you N (1<=N<=300000) line segments, calcula原创 2010-09-03 20:06:00 · 614 阅读 · 0 评论 -
2287 Tian Ji -- The Horse Racing 田忌赛马 贪心
Tian Ji -- The Horse RacingTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 6507 Accepted: 2002DescriptionHere is a famous story in Chinese history. That was about 2300 years ago. General Tian Ji was a high official in the country Qi. He likes to原创 2010-09-15 17:01:00 · 1059 阅读 · 0 评论 -
hdu 1050 Moving Tables 类似活动安排问题
Moving TablesTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5612 Accepted Submission(s): 1888Problem DescriptionThe famous ACM (Advanced Computer Maker) Company has rented a floor of a building wh原创 2010-08-02 12:47:00 · 845 阅读 · 2 评论 -
hdu 1009 FatMouse' Trade
FatMouse' Trade<br />Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)<br />Total Submission(s): 12798 Accepted Submission(s): 3758<br /><br />Problem DescriptionFatMouse prepared M pounds of cat food, ready to trade wi原创 2010-08-02 11:05:00 · 545 阅读 · 0 评论 -
hdu 2037 今年暑假不AC 活动安排
今年暑假不AC<br />Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)<br />Total Submission(s): 6795 Accepted Submission(s): 3418<br /><br />Problem Description“今年暑假不AC?”<br />“是的。”<br />“那你干什么呢?”<br />“看世界杯呀,笨蛋!”<br />“@#$%^&原创 2010-08-02 11:22:00 · 529 阅读 · 0 评论 -
2426: Minimize the number 删数问题
2426: Minimize the numberResultTIME LimitMEMORY LimitRun TimesAC TimesJUDGE1s8192K1100153StandardGive you a n-bit (decimal base) number, please remove k bits (decimal base) of the number to get the minimal number according to its original sequence. InputTh原创 2010-07-10 22:07:00 · 531 阅读 · 0 评论 -
2680: Problem F
<br />#include<iostream><br />using namespace std;<br />int main()<br />{<br /> int n,a[110],b[110],i,j;<br /> while(scanf("%d",&n)==1)<br /> {<br /> for(i=0;i<n;i++) scanf("%d",a+i);<br /> for(i=0;i<n;i++) scanf("%d",b+i);<br />原创 2010-07-10 22:08:00 · 426 阅读 · 0 评论 -
hdu 3866 Moonfang's Birthday
Problem DescriptionIt's Moonfang's birthday,and his friends decided to buy him a copy of XianJianQiXiaZhuan V. Since some of friends have m原创 2011-07-28 15:33:17 · 646 阅读 · 0 评论