算法思维
文章平均质量分 82
___fouzhe
这个作者很懒,什么都没留下…
展开
-
UVA 11549(计算器谜题)
题目描述: Alice got a hold of an old calculator that can display n digits. She was bored enough to come up with the following time waster. She enters a number k then repeatedly squares it until the resu原创 2016-03-01 23:36:17 · 479 阅读 · 0 评论 -
gym100812G(想法题,最短路变形,好题)
题目链接G. Short Pathtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputIn my opinion, people are divided int原创 2017-02-18 09:09:45 · 640 阅读 · 0 评论 -
Codeforces Round #397 E. Tree Fold(bfs,想法题,好题)
题目链接E. Tree Foldingtime limit per test2 secondsmemory limit per test512 megabytesinputstandard inputoutputstandard outputVanya wants to minimize a tree. He原创 2017-02-19 11:39:01 · 267 阅读 · 0 评论 -
Codeforces Round #268 (Div. 1) C. Hack it!(二分+尺取/构造,好题)
C. Hack it!time limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputLittle X has met the following problem recently.原创 2017-02-28 16:38:44 · 408 阅读 · 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 · 541 阅读 · 0 评论 -
gym 100820G Racing Gems(二维LIS,好题)
题目链接Racing GemsYou are playing a racing game. Your character starts at thex axis (y= 0) and proceeds up therace track, which has a boundary at the linex = 0 and another atx =w.原创 2017-02-19 19:55:30 · 571 阅读 · 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 #352 (Div. 1) B. Robin Hood(想法+二分,好题)
题目链接B. Robin Hoodtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputWe all know the impressive story of Ro原创 2017-03-01 19:10:33 · 292 阅读 · 0 评论 -
Codeforces Round #395 (Div. 2)D(想法题,好题)
题目链接D. Timofey and rectanglestime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputOne of Timofey's birthday原创 2017-02-13 17:57:17 · 313 阅读 · 0 评论 -
Codeforces Round #394 (Div. 2) E. Dasha and Puzzle(想法题,构造题)
题目链接E. Dasha and Puzzletime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputDasha decided to have a rest af原创 2017-02-14 09:44:22 · 298 阅读 · 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 评论 -
gym 101170 Problem H Hamiltonian Hypercube(找规律?)
题目链接Problem HHamiltonian HypercubeHypercube graphs are fascinatingly regular, hence you have devoted a lot of time studying themathematics related to them. The vertices of a hypercube graph of d原创 2017-02-23 18:01:47 · 813 阅读 · 0 评论 -
Codeforces Round #257 (Div. 1) C. Jzzhu and Apples(构造题,想法题,好题)
题目链接C. Jzzhu and Applestime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputJzzhu has picked n apples from h原创 2017-02-23 22:19:52 · 597 阅读 · 0 评论 -
Codeforces Round #379 (Div. 2)E. Anton and Tree(dfs缩点,想法题)
E. Anton and Treetime limit per test3 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputAnton is growing a tree in his garden. In原创 2016-12-04 23:16:44 · 318 阅读 · 0 评论 -
gym 101194 china final Problem H. Great Cells(数学,想法题,好题)
题目链接Problem H. Great Cells Input file:Output file: Time limit:Standard InputStandard Ouptut2 secondsMr. Panda likes playing puzzles with grid paper. Recently he inv原创 2017-02-24 20:30:17 · 1289 阅读 · 0 评论 -
Codeforces Round #400 (Div. 1 + Div. 2, combined) D. The Door Problem(二分染色?/2-sat,好题)
题目链接D. The Door Problemtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputMoriarty has trapped n people i原创 2017-02-24 20:57:46 · 527 阅读 · 0 评论 -
gym100796C(想法题/二分+树形dp)
题目链接C. Minimax Treetime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputBob's new favourite toy is a rooted原创 2017-02-17 23:01:43 · 474 阅读 · 0 评论 -
Codeforces Round #211 (Div. 2)D. Renting Bikes(二分,想法题,好题)
题目链接D. Renting Bikestime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputA group of n schoolboys decided to原创 2016-12-20 00:06:48 · 313 阅读 · 0 评论 -
51nod1448 二染色问题(想法题,好题)
题目链接1448 二染色问题题目来源: TopCoder基准时间限制:1 秒 空间限制:131072 KB 分值: 40 难度:4级算法题 收藏 关注一个N*N的网格,初始为白色。现在有一个K*K的印章,每次操作:你可以用印章把网格中一个K*K的子矩形染成黑色或白色。如果一个格子被多次染色,那么后一次染色会覆盖掉前原创 2016-12-09 17:35:47 · 1125 阅读 · 0 评论 -
uva11078(开放制学分)
题目: In an open credit system, the students can choose any course they like, but there is a problem. Some of the students are more senior than other students. The professor of such a course has found原创 2016-03-01 23:39:23 · 421 阅读 · 0 评论 -
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 · 960 阅读 · 0 评论 -
uva 11300(分金币)
题目: A Communist regime is trying to redistribute wealth in a village. They have have decided to sit everyone around a circular table. First, everyone has converted all of their properties to coins of原创 2016-03-04 18:49:12 · 280 阅读 · 0 评论 -
uva 10881(ants)
题目: Piotr likes playing with ants. He has n of them on a horizontal pole L cm long. Each ant is facing either left or right and walks at a constant speed of 1 cm/s. When two ants bump into each other原创 2016-03-06 11:31:08 · 285 阅读 · 0 评论 -
uvalive 4254(二分+模拟)
分析: 大方向是二分答案,对每一秒进行模拟,判断是否能够处理完在这个时刻可以处理的任务,可以用优先队列储存当前可以执行的任务。当队列中元素不为空且里面有的元素的结束时间小于当前秒时,不能处理完;当队列中元素为空且判断完所有元素时说明可以以该速度执行。 ac代码:#include<iostream>#include<cstdio>#include<algorithm>#include<que原创 2016-03-08 17:00:46 · 463 阅读 · 0 评论 -
uva10891(sum游戏)区间dp
题目: This is a two player game. Initially there are n integer numbers in an array and players A and B get chance to take them alternatively. Each player can take one or more numbers from the left or r原创 2016-03-08 19:15:48 · 393 阅读 · 0 评论 -
cf 709D Recover the String(构造题)
题目链接D. Recover the Stringtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputFor each string s consisting o原创 2016-08-26 14:40:35 · 655 阅读 · 0 评论 -
51nod 1655 染色问题(想法题)
1655 染色问题基准时间限制:1 秒 空间限制:10240 KB 分值: 40 难度:4级算法题 收藏 关注一个n(3<=n<=100)个点的完全图,现在给出n,要求将每条边都染上一种颜色k(1<=k<=n),最终使得所有三个点构成的环(C(n,3)个不同的换)上三条边的颜色和在所有颜色中任选三种颜色的组合(C(n,3)种方案)一一对应原创 2016-10-11 00:49:13 · 675 阅读 · 0 评论 -
Codeforces Round 722C:Destroying Array(并查集,好题)
题目链接C. Destroying Arraytime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou are given an array consistin原创 2016-10-02 10:46:32 · 3508 阅读 · 0 评论 -
Codeforces Round #372 (Div. 1) D. Complete The Graph(最短路,想法题,好题)
D. Complete The Graphtime limit per test4 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputZS the Coder has drawn an undirected原创 2016-10-31 00:12:46 · 311 阅读 · 0 评论 -
Codeforces Round #377 (Div. 2)C. Sanatorium(想法题)
题目链接C. Sanatoriumtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputVasiliy spent his vacation in a sanato原创 2016-10-20 22:35:16 · 588 阅读 · 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 · 600 阅读 · 0 评论 -
Codeforces 729D Sea Battle(思维题,好题)
D. Sea Battletime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputGalya is playing one-dimensional Sea Battle on原创 2016-11-21 22:51:17 · 1566 阅读 · 0 评论 -
51node1677treecnt(组合数学,好题)
treecnt﹡ LH (命题人)基准时间限制:1 秒 空间限制:131072 KB 分值: 40给定一棵n个节点的树,从1到n标号。选择k个点,你需要选择一些边使得这k个点通过选择的边联通,目标是使得选择的边数最少。现需要计算对于所有选择k个点的情况最小选择边数的总和为多少。样例解释:一共有三种可能:(下列原创 2016-12-05 19:21:34 · 477 阅读 · 0 评论 -
Codeforces Round #381 (Div. 2)C. Alyona and mex(构造题,好题)
C. Alyona and mextime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputAlyona's mother wants to present an array原创 2016-11-25 23:46:42 · 409 阅读 · 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 · 795 阅读 · 0 评论