贪心
文章平均质量分 82
___fouzhe
这个作者很懒,什么都没留下…
展开
-
uva11039 设计建筑物
题目: Input The input file consists of a first line with the number p of cases to solve. The first line of each case contains the number of available floors. Then, the size and colour of each floor ap原创 2016-03-03 23:35:15 · 956 阅读 · 0 评论 -
51nod 1237 旅行计划(树,贪心)
1273 旅行计划题目来源: Codility基准时间限制:1 秒 空间限制:131072 KB 分值: 80 难度:5级算法题 收藏 关注某个国家有N个城市,编号0 至 N-1,他们之间用N - 1条道路连接,道路是双向行驶的,沿着道路你可以到达任何一个城市。你有一个旅行计划,这个计划是从编号K的城市出发,每天到达一个你没有去过原创 2016-11-15 13:23:38 · 1368 阅读 · 0 评论 -
SPOJ - UOFTCG(树的路径覆盖,好题)
题目链接UOFTCG - Office Matesno tags Dr. Baws has an interesting problem. His N graduate students, while friendly with some select people, are generally not friendly with each othe原创 2017-02-06 20:56:44 · 369 阅读 · 0 评论 -
Canada Cup 2016 F. Family Photos(贪心,想法,好题)
题目链接F. Family Photostime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputAlice and Bonnie are sisters, but原创 2017-02-19 17:38:25 · 539 阅读 · 0 评论 -
Codeforces Round #383 (Div. 2) E(贪心,二分图染色,好题)
题目链接E. Arpa’s overnight party and Mehrdad’s silent enteringtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard output原创 2017-02-20 11:55:18 · 534 阅读 · 0 评论 -
Codeforces Beta Round #3 D. Least Cost Bracket Sequence(贪心,想法,好题)
题目链接D. Least Cost Bracket Sequencetime limit per test1 secondmemory limit per test64 megabytesinputstandard inputoutputstandard outputThis is yet another pr原创 2017-02-20 20:12:19 · 377 阅读 · 0 评论 -
Codeforces Round #398 (Div. 2) E. Change-free(想法题,贪心,好题)
题目链接E. Change-freetime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputStudent Arseny likes to plan his life原创 2017-02-22 21:41:58 · 757 阅读 · 0 评论 -
gym101194 china final Problem D. Ice Cream Tower(二分)
题目链接Problem D. Ice Cream Tower Input file:Output file: Time limit:Standard InputStandard Ouptut6 secondsThe 2016 ACM-ICPC Asia China-Final ContestMr. Pa原创 2017-02-23 11:10:30 · 1312 阅读 · 0 评论 -
51nod 1821 最优集合(想法+贪心+并查集)
1821 最优集合基准时间限制:1 秒 空间限制:131072 KB 分值: 40 难度:4级算法题 收藏 关注一个集合S的优美值定义为:最大的x,满足对于任意i∈[1,x],都存在一个S的子集S',使得S'中元素之和为i。给定n个集合,对于每一次询问,指定一个集合S1和一个集合S2,以及一个数k,要求选择一个S2的子集S3(|S3|原创 2017-03-16 00:17:13 · 794 阅读 · 0 评论 -
Codeforces Round #382 (Div. 2)C. Tennis Championship(贪心)
C. Tennis Championshiptime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputFamous Brazil city Rio de Janeiro ho原创 2016-11-28 23:35:00 · 597 阅读 · 0 评论 -
Intel Code Challenge Elimination Round (Div.1 + Div.2, combined)D. Generating Sets(贪心)
题目链接D. Generating Setstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given a set Y of n disti原创 2016-10-04 10:12:39 · 315 阅读 · 0 评论 -
Codeforces Round #374 (Div. 2)D. Maxim and Array(贪心)
题目链接D. Maxim and Arraytime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputRecently Maxim has found an arra原创 2016-10-03 19:33:17 · 318 阅读 · 0 评论 -
codeforeceIndiaHacks 2016 - Online Edition (Div. 1 + Div. 2)A. Bear and Three Balls
题目: 水题,先排序,再用unique函数处理,再扫描一遍即可。 ac代码:#include<iostream>#include<cstdio>#include<algorithm>using namespace std;int a[55];int main(){ //freopen("in.txt","r",stdin); int n; scanf("%原创 2016-03-20 13:31:24 · 303 阅读 · 0 评论 -
uva1632Alibaba
题目描述: Alibaba the famous character of our childhood stories would like to be immortal in order to keep bringing happiness to children. In order to rich this status he needs to prove that he is still原创 2016-04-01 16:46:00 · 961 阅读 · 0 评论 -
hdu 5744(想法题)
题目链接题目描述: Keep On MovinTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 525 Accepted Submission(s): 381Problem Description Professor Zhang原创 2016-07-22 23:41:54 · 354 阅读 · 0 评论 -
HDU 5813 Elegant Construction (贪心)
Elegant ConstructionTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 0 Accepted Submission(s): 0Special JudgeProblem Description原创 2016-08-09 20:46:03 · 308 阅读 · 0 评论 -
hdu 5821 ball(多校第八场,贪心)
题目链接BallTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 386 Accepted Submission(s): 230Problem DescriptionZZX has a seq原创 2016-08-11 23:37:42 · 424 阅读 · 0 评论 -
hdu 4726 Kia's Calculation(贪心,好题)
题目链接Kia's CalculationTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3283 Accepted Submission(s): 702Problem Description原创 2016-09-22 18:34:54 · 452 阅读 · 0 评论 -
Canada Cup 2016 D. Contest Balloons(贪心,优先队列)
题目链接D. Contest Balloonstime limit per test3 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputOne tradition of ACM-ICPC conte原创 2016-10-25 00:00:03 · 399 阅读 · 0 评论 -
Codeforces Round #375 (Div. 2) C. Polycarp at the Radio(贪心)
题目链接C. Polycarp at the Radiotime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputPolycarp is a music editor原创 2016-10-04 09:31:45 · 618 阅读 · 0 评论 -
gym 100801G.Graph(拓扑排序,贪心构造)
gym 100801G题意:给出 nnn 个点 mmm 条边的 DAGDAGDAG,要求最多加 kkk 条有向边(不能形成环),使得可能的字典序最小的拓扑序列最大。输出最终最小的拓扑序列,以及加边数,加的边(1≤n≤105,0≤m≤1051≤n≤105,0≤m≤1051 \leq n \leq 10^5,0 \leq m \leq 10^5)题解:用两个优先队列 minQ,maxQ...原创 2018-03-23 11:50:38 · 358 阅读 · 0 评论