贪心
u010660276
这个作者很懒,什么都没留下…
展开
-
贪心--poj1862
思路;水题,只要拍一下序就解决了。下面是代码:#include#include#include#include#include#include#include#include#include#includetypedef long long LL;using namespace std;int a[110];int main(){ int N;原创 2013-09-30 14:42:38 · 598 阅读 · 0 评论 -
Codeforces Round #229 (Div. 2)(C,E待续)
A. Inna and Alarm ClockInna loves sleeping very much, so she needs n alarm clocks in total to wake up. Let's suppose that Inna's room is a100 × 100 square with the lower left corner at point原创 2014-02-17 20:06:39 · 858 阅读 · 0 评论 -
Codeforces Round #197 (Div. 2)(d线段树)
A - Helpful Maths水题不多说#include#include#include#include#includeusing namespace std;int main(){ int a[105],n=0; string s; cin>>s; for(int i=0;i<s.size();i++) if(s[原创 2014-03-09 09:50:09 · 551 阅读 · 0 评论 -
Codeforces Round #244 (Div. 2)(强连通分量,后缀数组)
A. Police Recruits#include#include#include#includeusing namespace std;int n;int main(){ //freopen("in.txt","r",stdin); cin>>n; int ans=0,x,p=0; for(int i=0;i<n;i++) {原创 2014-05-23 20:08:33 · 839 阅读 · 0 评论 -
Codeforces Round #251 (Div. 2)
D. Devu and his Brothertime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputDevu and his brother love each other a lot. As原创 2014-06-21 15:51:56 · 496 阅读 · 0 评论 -
后缀数组+贪心+poj3623
Best Cow Line, GoldTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 4488 Accepted: 1664DescriptionFJ is about to take his N (1 ≤ N ≤ 30,000) cows to th原创 2014-07-30 13:36:34 · 573 阅读 · 0 评论 -
经典贪心(区间覆盖)
Problem EWatering GrassInput: standard inputOutput: standard outputTime Limit: 3 secondsn sprinklers are installed in a horizontal strip of grass l meters long andw meters wide. Each s原创 2014-10-30 16:02:09 · 516 阅读 · 0 评论 -
Codeforces Round #276 (Div. 2)(C贪心,D)
C. Bitstime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputLet's denote as the number of bits set ('1' bits) in the bina原创 2014-11-08 09:58:41 · 626 阅读 · 0 评论 -
贪心(最大团)||dp+线段树(Codeforces Round #296 (Div. 2)D. Clique Problem)
D. Clique Problemtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputThe clique problem is one of the most well-known NP原创 2015-03-18 22:25:42 · 488 阅读 · 0 评论 -
2015年百度之星初赛(hdu5246-5251)
超级赛亚ACMer Accepts: 868 Submissions: 5329 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Problem Description百小度是一个ACMer,也是一个超级赛亚人,每个A原创 2015-05-31 12:34:01 · 937 阅读 · 0 评论 -
Codeforces Round #211 (Div. 2)(二分贪心)
A - Soroban用算盘表示数,先预存每个数字的表示形式,然后直接按位输出。#include#include#includeusing namespace std;string s[]={"O-|-OOOO","O-|O-OOO","O-|OO-OO","O-|OOO-O","O-|OOOO-","-O|-OOOO","-O|O-OOO","-O|OO-OO","-O|OO原创 2014-02-22 18:53:45 · 567 阅读 · 0 评论 -
Codeforces Round #225 (Div. 2)(B思维题,E:dfs+树状数组)
A. Coder题意:在一张网格上放置棋子,他能攻击到上下左右的地方,问最多放多少棋子,使其不能相互攻击到,输出一种方法;思路:从第一个开始放,标记其上下左右。#include#include#includeusing namespace std;const int maxn=1005;char grid[maxn][maxn];bool vis[maxn][maxn];原创 2014-02-01 15:55:49 · 631 阅读 · 0 评论 -
树上最优解+贪心+dfs+LA3902
第一个dfs计算出叶结点的深度,第二个又来标记安放一个服务器后可以覆盖那些节点。下面是代码:#include#include#include#include#includeusing namespace std;const int maxn=1010;int n,s,k,fa[maxn];vector gr[maxn],nodes[maxn];bool cover[max原创 2014-01-02 20:01:03 · 601 阅读 · 0 评论 -
贪心--poj3262
Language:DefaultProtecting the FlowersTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 3371 Accepted: 1370DescriptionFarmer John went to cut some原创 2013-09-30 15:17:12 · 816 阅读 · 0 评论 -
poj3614-贪心、优先队列
Language:DefaultSunscreenTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 2754 Accepted: 958DescriptionTo avoid unsightly burns while tanning,原创 2013-10-01 15:25:38 · 1379 阅读 · 0 评论 -
贪心(好题)--poj3190
Language:DefaultStall ReservationsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 2112 Accepted: 751 Special JudgeDescriptionOh those picky原创 2013-09-25 22:59:02 · 2270 阅读 · 0 评论 -
贪心区间覆盖--poj2378
Language:DefaultCleaning ShiftsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 8679 Accepted: 2325DescriptionFarmer John is assigning some of hi原创 2013-09-21 21:54:16 · 855 阅读 · 0 评论 -
贪心--poj1017
Language:DefaultPacketsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 40428 Accepted: 13551DescriptionA factory produces products packed in squ原创 2013-09-29 11:36:12 · 629 阅读 · 0 评论 -
贪心--poj2393
Language:DefaultYogurt factoryTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 5634 Accepted: 2898DescriptionThe cows have purchased a yogurt fac原创 2013-09-27 22:17:43 · 1519 阅读 · 0 评论 -
贪心(不错)--poj3040
贪心,从大到小排序,只要不超额就能放多少就放多少,最后再从小的开始找一个放进去能超额的。正确性证明,因为大的是小的倍数,所以大的放进去不超额一定要放进去,因为小的不管怎么取,再超过c之前一定会凑成这个大的面额,那么用大的代替一定更优。第一步做完之后,那么现在一定要再放进去一个硬币,那么选择最小的并且能大于c的也一定是最优的。#include #include #include转载 2013-09-29 12:46:06 · 633 阅读 · 0 评论 -
Codeforces Round #202 (Div. 2)B-贪心
B:先找数量多的,然后根据剩余的是否能跟现有的凑成一个更大的下面是代码:#include#include#include#include#include#include#include#include#include#include#includetypedef long long LL;using namespace std;const int M=1000原创 2013-10-25 15:42:29 · 626 阅读 · 0 评论 -
求字典序最小解+贪心
Problem AFill the SquareInput: Standard InputOutput: Standard Output In this problem, you have to draw a square using uppercase English Alphabets.To be more precise, you will be given a sq原创 2013-12-28 22:47:09 · 877 阅读 · 0 评论 -
2008 Asia Regional Beijing (网络流+树状数组+贪心)hdu2485 - 2494
Destroying the bus stationsProblem DescriptionGabiluso is one of the greatest spies in his country. Now he’s trying to complete an “impossible” mission —– to make it slow for the army of City Colugu to原创 2015-07-27 16:54:28 · 448 阅读 · 0 评论