贪心
猪猪奋斗记
这个作者很懒,什么都没留下…
展开
-
codeforce389A
很明显的贪心题 所以就不过多的分析了每次都用最大值减去最小值 就可得到最优解#include #include #define N 100using namespace std;int a[N];bool cmp(int a,int b){ return a>b;}int main(){ int n; while(cin>>n) {原创 2014-03-04 18:59:17 · 677 阅读 · 0 评论 -
HDU 5242 Game(2015年上海大都会G题)
HDU 5242 Game(2015年上海大都会G题)The 2015 ACM-ICPC China Shanghai Metropolitan Programming Contest原创 2015-08-30 16:27:46 · 1188 阅读 · 0 评论 -
Codeforces 484B Maximum Value(排序+二分)
Codeforces 484B Maximum Value原创 2014-11-10 12:44:12 · 1285 阅读 · 0 评论 -
UVALive 4855 Hyper Box
DescriptionYou live in the universe X where all the physical laws and constants are different from ours. For example all of their objects areN-dimensional. The living beings of the universe X wa原创 2014-08-09 20:45:49 · 848 阅读 · 0 评论 -
uva10954Add All(贪心+优先队列)
题目链接:http://vjudge.net/contest/view.action?cid=50494#problem/DAdd AllInput: standard inputOutput: standard outputYup!! The problem name reflects your task; just add a set of numbers. But原创 2014-07-22 16:03:04 · 773 阅读 · 0 评论 -
CF448C Painting Fence(递归+贪心)
C. Painting Fencetime limit per test 1 secondmemory limit per test 512 megabytesinput standard inputoutput standard outputBizon the Champion isn't just attentiv原创 2014-07-20 16:57:07 · 865 阅读 · 0 评论 -
FZU 2111Min Number
题目链接:原创 2014-06-05 18:49:35 · 589 阅读 · 0 评论 -
CF160 B Unlucky Ticket (sort)
B. Unlucky Tickettime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputEach of you probably has your personal ex原创 2014-05-14 10:09:25 · 661 阅读 · 0 评论 -
排队接水(sort)
排队接水Time Limit 1000msMemory Limit 65536Kdescription有n个人在一个水龙头前排队接水,假如每个人接水的时间为Ti,请编程找出这n个人排队的一种顺序,使得n个人的平均等待时间最小。 input原创 2014-02-27 20:40:52 · 1910 阅读 · 0 评论 -
zoj3410 Layton's Escape (优先队列)
题目链接:原创 2014-05-20 09:56:49 · 627 阅读 · 0 评论 -
CodeForces 250A Paper Work
Polycarpus has been working in the analytic department of the "F.R.A.U.D." company for as much as n days. Right now his task is to make a series of reports about the company's performance for the la原创 2014-04-24 19:53:59 · 794 阅读 · 0 评论 -
codeforces 379CNew Year Ratings Change(MAP的用法)
DescriptionOne very well-known internet resource site (let's call it X) has come up with a New Year adventure. Specifically, they decided to give ratings to all visitors.There are n users on the原创 2014-03-19 16:36:19 · 838 阅读 · 0 评论 -
hdu1789
Problem DescriptionIgnatius has just come back school from the 30th ACM/ICPC. Now he has a lot of homework to do. Every teacher gives him a deadline of handing in the homework. If Ignatius hands i原创 2014-03-28 15:18:00 · 925 阅读 · 0 评论 -
HDU5630 Hiking(贪心+优先队列)
HDU5630 Hiking(贪心+优先队列) 2015年多校联合训练第6场原创 2015-08-07 15:14:45 · 642 阅读 · 0 评论