贪心
ACM__dongsheng
在校大学生
展开
-
hdu 5246 超级赛亚ACMer
百小度是一个ACMer,也是一个超级赛亚人,每个ACMer都有一个战斗力,包括百小度。 所谓超级赛亚人的定义,是说如果在对抗中刚好接近极限状态,那就会激发斗志,实力提升.具体来说,就是百小度现在要接受一些ACMer的挑战了,这些ACMer有n个人,第i个人的战斗力是a[i]。 百小度接下来可以自主安排与这n个ACMer的PK顺序,他要想在PK赛中赢过另外一个ACMer,就必须使得自己的战斗力不小于对原创 2016-03-15 20:29:57 · 393 阅读 · 0 评论 -
hdu 1677 Nested Dolls
Problem DescriptionDilworth is the world’s most prominent collector of Russian nested dolls: he literally has thousands of them! You know, the wooden hollow dolls of different sizes of which the smalle原创 2016-03-23 22:38:12 · 405 阅读 · 0 评论 -
hdu 1288Hat's Tea
Problem Description Hat is a member of PG Studio. Hat codes a lot and so he often buys tea at tea vending machine. But the tea vending machine just eat coins and spit out tea, if you feed the machine原创 2016-04-06 22:44:20 · 750 阅读 · 0 评论 -
csu 1751: 卡牌通行证
DescriptionA城市的宴会宾客进场都是要有对应编号的卡牌的,在A城市的各个商店中都能买到这样的卡牌,不同标号的卡牌价钱都一样为单位1,最近这段时间有n场宴会,每场宴会都有自己要求对应的卡牌编号,这些编号保证是连续,也就是说你只要有标号为[ai,bi]中的任意一张卡牌你都能进入这个宴会。小明现在很渴望参加宴会并在其中找到自己心仪的女生,所以他每场都不想错过,他现在已经知道了每场宴会对应要求的编原创 2016-06-26 11:39:38 · 588 阅读 · 0 评论 -
A -- A. Quailty and Playing Cards
DESCRIPTIONOur friend Quailty is playing a card game with his friend Skywalkert.The game is played with a standard 52-card deck, with 13 cards from each of the four suits (hearts, spades, clubs, and di原创 2016-09-26 15:51:14 · 591 阅读 · 0 评论 -
1107 - Niro loves Chinese
DESCRIPTIONOnce upon a time a little girl named Niro found an ancient book in a forest. Written on it was an ancient story named Nyu Wa Repairs the Sky. This story only consisted of characters ‘0’s and原创 2017-03-22 11:25:30 · 1046 阅读 · 0 评论 -
hdu 5933 ArcSoft's Office Rearrangement
Problem Description ArcSoft, Inc. is a leading global professional computer photography and computer vision technology company.There are N working blocks in ArcSoft company, which form a straight line原创 2017-03-14 13:31:45 · 369 阅读 · 0 评论 -
hdu 5969 最大的位或
Problem Description B君和G君聊天的时候想到了如下的问题。 给定自然数l和r ,选取2个整数x,y满足l <= x <= y <= r ,使得x|y最大。 其中|表示按位或,即C、 C++、 Java中的|运算。Input 包含至多10001组测试数据。 第一行有一个正整数,表示数据的组数。 接下来每一行表示一组数据,包含两个整数l,r。 保证 0 <= l <=原创 2017-03-14 13:34:02 · 429 阅读 · 0 评论 -
codeforce Anton and Classes
题意:给你两个线段集合A,B,求它们之间的最大距离。距离的定义为:如果相交,则为0。否则,为: 右边线段的L-左边线段的R. 所以最大距离 为:A.L(max) - B.R(min) or B.L(max) - A.R(min);#include <bits\stdc++.h>using namespace std;struct point{ int l; int r;}原创 2017-03-16 16:46:42 · 419 阅读 · 0 评论