枚举
枚举
浪漫些许潦草
这个作者很懒,什么都没留下…
展开
-
hdu 5128 The E-pang Palace(计算几何,暴力枚举)
The E-pang PalaceProblem Description E-pang Palace was built in Qin dynasty by Emperor Qin Shihuang in Xianyang, Shanxi Province. It was the largest palace ever built by human. It was so large and so原创 2017-04-27 20:39:33 · 679 阅读 · 0 评论 -
poj 3522 Slim Span(Kruskal+枚举)
Slim SpanDescriptionGiven an undirected weighted graph G, you should find one of spanning trees specified as follows.The graph G is an ordered pair (V, E), where V is a set of vertices {v1, v2, …, vn}原创 2017-07-20 16:55:50 · 614 阅读 · 0 评论 -
nyoj 104 最大和(子矩阵最大和)(枚举)
最大和描述 给定一个由整数组成二维矩阵(r*c),现在需要找出它的一个子矩阵,使得这个子矩阵内的所有元素之和最大,并把这个子矩阵称为最大子矩阵。 例子: 0 -2 -7 0 9 2 -6 2 -4 1 -4 1 -1 8 0 -2 其最大子矩阵为:9 2 -4 1 -1 8 其元素总和为15。 输入 第一行输入一个整数n(0<n<=100),表示有n组测试数据;原创 2017-07-12 15:14:30 · 676 阅读 · 0 评论 -
hdu The Frog's Games(二分枚举)
The Frog's Games原题链接:http://acm.hdu.edu.cn/showproblem.php?pid=4004题目大意:长为L的河流,中间有n个石头,告诉你石头的位置,青蛙的跳跃能力至少为多少时最终跳m次能跳过终点思路:因为青蛙的跳跃能力越强需要的次数就越少,因此青蛙的跳跃能力有单调性,所以二分枚举青蛙的跳跃能力,再判断在这个能力下是否能够跳过去。这个用原创 2016-11-28 16:55:45 · 591 阅读 · 0 评论 -
hihoCoder 字符消除 (字符串处理)(枚举)
字符消除描述小Hi最近在玩一个字符消除游戏。给定一个只包含大写字母"ABC"的字符串s,消除过程是如下进行的:1)如果s包含长度超过1的由相同字母组成的子串,那么这些子串会被同时消除,余下的子串拼成新的字符串。例如"ABCCBCCCAA"中"CC","CCC"和"AA"会被同时消除,余下"AB"和"B"拼成新的字符串"ABB"。2)上述消除会反复一轮一轮进行,直到新原创 2016-11-29 09:44:15 · 850 阅读 · 0 评论 -
poj Flip Game(DFS)(枚举)
Flip GameDescriptionFlip game is played on a rectangular 4x4 field with two-sided pieces placed on each of its 16 squares. One side of each piece is white and the other one is black and each原创 2017-02-20 20:45:39 · 528 阅读 · 0 评论 -
poj 昂贵的聘礼(spfa)(枚举)
昂贵的聘礼Description年轻的探险家来到了一个印第安部落里。在那里他和酋长的女儿相爱了,于是便向酋长去求亲。酋长要他用10000个金币作为聘礼才答应把女儿嫁给他。探险家拿不出这么多金币,便请求酋长降低要求。酋长说:"嗯,如果你能够替我弄到大祭司的皮袄,我可以只要8000金币。如果你能够弄来他的水晶球,那么只要5000金币就行了。"探险家就跑到大祭司那里,向他要求皮袄或水原创 2017-02-22 20:04:03 · 441 阅读 · 0 评论 -
SCU 4489 misaka and last order(暴力枚举)
misaka and last orderDescriptionMisaka Mikoto is a main character of the Animation "To Aru Majutsu no Index" and "To Aru Kagaku no Railgun". She was enrolled into the Academy City to train he原创 2017-03-18 16:20:28 · 666 阅读 · 0 评论 -
2017蓝桥杯模拟题 猜算式(暴力枚举)
猜算式ps:暴力枚举即可代码:#include<stdio.h>#include<string.h>int num[15];int judge(int x){ while(x) { num[x%10]++; if(num[x%10]>2) return 0; x/=10; } return原创 2017-03-29 21:04:02 · 1346 阅读 · 0 评论 -
poj 2912 Rochambeau(带权并查集)(枚举)
RochambeauDescriptionN children are playing Rochambeau (scissors-rock-cloth) game with you. One of them is the judge. The rest children are divided into three groups (it is possible that some group is原创 2017-04-01 20:16:32 · 1080 阅读 · 1 评论 -
2017蓝桥杯模拟题 风险度量(暴力枚举)
思路:由于数据范围比较小,所以直接枚举每一个点是否为关键点即可代码:#include<stdio.h>#define maxn 2000+10int pre[maxn],u[maxn],v[maxn];int n,m,x,y;void init(){ for(int i=1; i<=n; ++i) pre[i]=i;}int Find(int x){ if(原创 2017-04-06 18:04:47 · 991 阅读 · 0 评论 -
nyoj 1242 Interference Signal(暴力枚举)
描述 Dr.Kong’s laboratory monitor some interference signals. The interference signals can be digitized into a series of positive integer. May be, there are N integers a1,a2,…,an.Dr.Kong wants to know th原创 2017-04-24 08:33:08 · 406 阅读 · 0 评论 -
hdu 4770 Lights Against Dudely(暴力枚举dfs)
Lights Against DudelyProblem Description Harry: “But Hagrid. How am I going to pay for all of this? I haven’t any money.” Hagrid: “Well there’s your money, Harry! Gringotts, the wizard bank! Ain’t n原创 2017-04-30 17:17:14 · 500 阅读 · 0 评论 -
hdu 4771 Stealing Harry Potter's Precious(DFS+BFS)
Stealing Harry Potter’s PreciousProblem Description Harry Potter has some precious. For example, his invisible robe, his wand and his owl. When Hogwarts school is in holiday, Harry Potter has to go原创 2017-04-29 15:52:10 · 610 阅读 · 1 评论 -
CSU 1116 Kingdoms(Kruskal)(枚举)
KingdomsDescription A kingdom has n cities numbered 1 to n, and some bidirectional roads connecting cities. The capital is always city 1. After a war, all the roads of the kingdom are destroyed. The原创 2017-05-10 16:58:05 · 490 阅读 · 0 评论