算法和数据结构
文章平均质量分 82
keysen_yu
这个作者很懒,什么都没留下…
展开
-
hdu 4771 Stealing Harry Potter's Precious
ac代码》》》》》》》》》》#include#include#include#include#include#include#define inf 999999999using namespace std;int dp[110][110][33];int map[110][110];int n, m, k;int nx[10],ny[原创 2014-08-08 16:43:14 · 491 阅读 · 0 评论 -
poj 2386 lake Counting
DescriptionDue to recent rains, water has pooled in various places in Farmer John's field, which is represented by a rectangle of N x M (1 <= N <= 100; 1 <= M <= 100) squares. Each square contains原创 2014-08-25 17:06:20 · 468 阅读 · 0 评论 -
2503 Babelfish 二分 字典树 map容器
DescriptionYou have just moved from Waterloo to a big city. The people here speak an incomprehensible dialect of a foreign language. Fortunately, you have a dictionary to help you understand them.原创 2014-08-26 16:57:43 · 593 阅读 · 0 评论 -
hdu 2087 剪花布条 KMP
#include #include #include #include using namespace std;char substr[100002];char str[100002];int next[100002];void getnext(){ int len=strlen( substr ); int i=0, j=-1; next[0]=-原创 2014-08-27 15:38:35 · 487 阅读 · 0 评论 -
1358 Period hdu kmp的next数组运用
PeriodTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3085 Accepted Submission(s): 1544Problem DescriptionFor each prefix of原创 2014-08-28 16:37:23 · 476 阅读 · 0 评论 -
递归
逆波兰数#include #include #include #include using namespace std;char str[1100];double Ans(){ scanf( "%s", str ); if( str[0]=='*' ) return Ans()*Ans(); else if( str[0]=='+原创 2014-09-14 20:40:58 · 403 阅读 · 0 评论 -
归并排序 逆序数
#include #include #include using namespace std;int a[11000];int b[11000];int sum;void Union( int low, int high ){ int mid=( low+high )/2; int k=0; int i=mid; int j=high;原创 2014-09-19 17:03:41 · 434 阅读 · 0 评论 -
hdu 1022 Train Problem I
#include #include #include #include using namespace std;int main(){ int i, j, k, t, Cas; int n, m; char a[110],b[101],c[101]; int d[300]; while( scanf( "%d%s%s", &n, a, b原创 2014-09-24 22:35:03 · 397 阅读 · 0 评论 -
01背包 装满 hdu 1079 The Balance
#include #include #include #define N 20005using namespace std;int i, j, x, kk, n, m;int t;int Dp[N];int a[N];int ans[N];int main(){ while( scanf( "%d", &n )!=-1 ) { int su原创 2014-09-30 14:19:06 · 532 阅读 · 0 评论 -
map hdu 4022 Bombing
#include #include #include #include #include #include using namespace std;typedef map > def;int n, m;void pop( def &a, def &b, int k ){ printf( "%d\n", a[k].size() ); for( multise原创 2014-09-30 22:36:27 · 436 阅读 · 0 评论 -
hdu 4504 威威猫系列故事——篮球梦 Dp
Problem Description 威威猫十分迷恋篮球比赛,是忠实的NBA球迷,他常常幻想自己那肥硕的身躯也能飞起扣篮。另外,他对篮球教练工作也情有独钟,特别是对比赛的战术,投篮选择方面也是很有研究,下面就是威威猫研究过的一个问题: 一场NBA篮球比赛总共48分钟,假如我们现在已经知道当前比分 A:B,A代表我方的比分,B代表对方的比分,现在比赛还剩下t秒时间。我们简单的认为双原创 2014-08-17 14:15:23 · 665 阅读 · 0 评论 -
poj 1674 Sorting by Swapping
DescriptionGiven a permutation of numbers from 1 to n, we can always get the sequence 1, 2, 3, ..., n by swapping pairs of numbers. For example, if the initial sequence is 2, 3, 5, 4, 1, we can so原创 2014-08-16 10:05:39 · 441 阅读 · 0 评论 -
RedIsGood 概率dp
桌面上有R张红牌和B张黑牌,随机打乱顺序后放在桌面上,开始一张一张地翻牌,翻到红牌得到1美元,黑牌则付出1美元。可以随时停止翻牌,在最优策略下平均能得到多少钱。原创 2014-08-14 18:53:59 · 664 阅读 · 0 评论 -
hdu 1565 方格取数(1)
状态压缩》》》》》》》》》》》》》》》》》》》》》》》》#include#include#include#include#include#include#include#define inf 999999999using namespace std;int Min( int a,int b ){return a>b?b:a;}原创 2014-08-08 21:39:23 · 433 阅读 · 0 评论 -
又一个被坑的题 读题太不细心了 hdu 1260 简单dp
#include#include#include#include#include#includeusing namespace std;int n, m, k, sum, count;int num[110000];int two[110000];int dp[110000];int Min( int a, int b ){原创 2014-08-10 14:01:04 · 527 阅读 · 0 评论 -
又是一个大坑题 坑了我一上午 4932 Miaomiao's Geometry
Problem DescriptionThere are N point on X-axis . Miaomiao would like to cover them ALL by using segments with same length.There are 2 limits:1.A point is convered if there is a segments T原创 2014-08-11 14:03:47 · 541 阅读 · 0 评论 -
poj 1166 The Clocks
#include#include#include#include#include#includeusing namespace std;int n, m, sum, count, flag;int num[110];int main(){int i, j, k, t, cas=0;int c[20];int f=0;m原创 2014-08-11 19:11:48 · 972 阅读 · 0 评论 -
hdu 2802 F(N)
Problem DescriptionGiving the N, can you tell me the answer of F(N)? InputEach test case contains a single integer N(1 OutputFor each test case, output on a line the原创 2014-08-11 19:33:55 · 538 阅读 · 0 评论 -
1429 胜利大逃亡( 续 ) hdu
Ignatius再次被魔王抓走了(搞不懂他咋这么讨魔王喜欢)……这次魔王汲取了上次的教训,把Ignatius关在一个n*m的地牢里,并在地牢的某些地方安装了带锁的门,钥匙藏在地牢另外的某些地方。刚开始Ignatius被关在(sx,sy)的位置,离开地牢的门在(ex,ey)的位置。Ignatius每分钟只能从一个坐标走到相邻四个坐标中的其中一个。魔王每t分钟回地牢视察一次,若发现Ignati原创 2014-08-12 16:01:06 · 551 阅读 · 0 评论 -
1278 hdu 漂亮面料的设计
现在的CAD技术已经能够很方便地设计出漂亮的面料,如图(b)所示。图(a)是所对应的组织图,它表示纱线的交织规律,经过分析表明:组织规律可以用一个二维矩阵准确描述出来。图(a)的描述矩阵为:000010111111001100011100011001111110100000010011111001100001110000110011111001000001011111001原创 2014-08-12 23:19:17 · 980 阅读 · 0 评论 -
hdu 1198 Farm Irrigation
Problem DescriptionBenny has a spacious farm land to irrigate. The farm land is a rectangle, and is divided into a lot of samll squares. Water pipes are placed in these squares. Different square h原创 2014-08-13 13:04:51 · 419 阅读 · 0 评论 -
cf Feed with Candy 这题做的都想哭
inputstandard inputoutputstandard outputThe hero of the Cut the Rope game is a little monster named Om Nom. He loves candies. And what a coincidence! He also is the hero of today's p原创 2014-08-13 20:39:20 · 626 阅读 · 0 评论 -
dfs hdu 1010 Tempter of the Bone
#include #include #include #include using namespace std;char str[11][11];int used[11][11];int n, m, t;int flag;int mx[4]={1,-1,0,0};int my[4]={0,0,-1,1};int ok( int x, int y ){ if(原创 2014-10-01 15:46:48 · 425 阅读 · 0 评论 -
vector dfs 4739 Zhuge Liang's Mines
#include #include #include #include using namespace std;struct Node{ int x, y;}s[10001];struct node{ int a, b, c, d; node( int aa, int bb, int cc, int dd ) { a=aa;b=原创 2014-10-04 19:42:37 · 444 阅读 · 0 评论 -
二分 + 快排
#include void binarySearch(int a[],int x,int l,int r){ int flag = 0; while(l<=r) { int mid = (l+r)/2; if(x<a[mid]) { r=mid-1; } else原创 2016-08-17 11:43:51 · 299 阅读 · 0 评论 -
LinkNode
#include struct node{ int data; node *next; node() { next = NULL; }};node *head;void addLink(){ node *now = head; while(now->next) { now = now原创 2016-08-17 12:08:25 · 3782 阅读 · 0 评论 -
Connect the Cities
Problem DescriptionIn 2100, since the sea level rise, most of the cities disappear. Though some survived cities are still connected with others, but most of them become disconnected. The government原创 2014-07-26 22:28:05 · 592 阅读 · 0 评论 -
poj 2828 Buy Tickets 线段树
#include#include#include#include#include#includeusing namespace std;int n, m, sum, count, flag;struct node{int l, r, sum, v;}s[600001];struct Node{int pos, v;}num[200原创 2014-08-11 15:36:14 · 473 阅读 · 0 评论 -
spfa hdu2544 蓝桥
蓝桥 带负权值的最短路#include #include #include #include using namespace std;int n, m, t;struct node{ int v, dis, next;}s[200001];int used[200001];int dis[200001];int head[200001];void add(原创 2015-03-08 16:32:32 · 352 阅读 · 0 评论 -
FZU 2171 防守阵地 II 线段树
Problem Description部队中总共有N个士兵,每个士兵有各自的能力指数Xi,在一次演练中,指挥部确定了M个需要防守的地点,指挥部将选择M个士兵依次进入指定地点进行防守任务,获得的参考指数即为M个士兵的能力之和。随着时间的推移,指挥部将下达Q个指令来替换M个进行防守的士兵们,每个参加完防守任务的士兵由于疲惫等原因能力指数将下降1。现在士兵们排成一排,请你计算出每次进行防守的士兵原创 2014-08-17 11:32:50 · 627 阅读 · 0 评论 -
最大流 代码
#include"stdio.h"#include"string.h"#include"queue"using namespace std;#define N 205const int inf=0x7fffffff;int g[N][N];int pre[N],mark[N];int ek(int n){ int i,u,d,ans=0; while(1)原创 2014-09-14 12:00:39 · 582 阅读 · 0 评论 -
poj 3254 Corn Fields
Language:DefaultCorn FieldsTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 7364 Accepted: 3924DescriptionFarmer John has purchased a lush new rect原创 2014-08-06 14:49:12 · 405 阅读 · 0 评论 -
匈牙利算法 poj 2466 Chessboard
#include#include#include#include#include#define inf 999999999using namespace std;struct node{ int x; int y;};char str[220][220];int map[220][220];int link[1220];int used[1220];int n,原创 2014-09-14 11:59:13 · 639 阅读 · 0 评论 -
煞笔题
第八届河南省acm10409: D.引水工程Time Limit: 2 Sec Memory Limit: 128 MBSubmit: 22 Solved: 12[Submit][Status][Web Board]Description南水北调工程是优化水资源配置、促进区域协调发展的基础性工程,是新中国成立以来投资额最大、涉及面最广的战略性工程,事关中华民族长原创 2015-05-24 00:30:30 · 438 阅读 · 0 评论 -
hdu 3908
#include #include #include #include #define LL __int64using namespace std;int gcd(int a,int b){ if(b==0) { if(a==1) return 1; return 0; } return gc原创 2015-04-23 22:53:18 · 448 阅读 · 0 评论 -
给四个点,证明能形成一个正方形 hdu 5206
#include #include #include #include #include #define LL __int64using namespace std;struct node{ LL x; LL y; LL z;}s[4];LL a[4];LL used[4];int flag;double cal(int a,int b)原创 2015-04-23 18:15:02 · 660 阅读 · 0 评论 -
树形dp ( vector dfs 01背包 ) hdu 1011 Starship Troopers
#include #include #include #include using namespace std;int n, m;int dp[101][101];int used[101];int need[101];int get[101];vectorv[101];void dfs( int x ){ int i, j, k; used[x]=1;原创 2014-10-04 22:30:34 · 503 阅读 · 0 评论 -
map容器运用 codeforces
D. CGCDSSQtime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputGiven a sequence of integers a1, ..., an and q q原创 2014-10-08 14:37:28 · 424 阅读 · 0 评论 -
vector 3682 To Be an Dream Architect
#include #include #include #include #include using namespace std;vectorV;int n, m;int cal( char a, int num1, char b, int num2, int index ){ if( a=='Y' && b=='Z' ) return index*n*n+原创 2014-10-10 18:09:50 · 445 阅读 · 0 评论 -
分治 求点对最短距离 hdu 1007 Quoit Design
#include #include #include #include using namespace std;struct node{ double x; double y;} s[100001];int A[100001];bool cmp( node a, node b ){ return a.x<b.x;}bool cmpy( int原创 2014-10-12 16:44:11 · 568 阅读 · 0 评论