上一页 1 ··· 5 6 7 8 9 10 11 12 13 ··· 56 下一页
2013年7月4日
POJ 2230 Watchcow （欧拉回路）
摘要： WatchcowTime Limit:3000MSMemory Limit:65536KTotal Submissions:5258Accepted:2206Special JudgeDescriptionBessie's been appointed the new watch-cow for the farm. Every night, it's her job to walk across the farm and make sure that no evildoers are doing any evil. She begins at the barn, makes h 阅读全文
posted @ 2013-07-04 09:42 Jack Ge 阅读(314) 评论(0) 推荐(0)
POJ 2337 Catenyms （欧拉回路）
摘要： CatenymsTime Limit:1000MSMemory Limit:65536KTotal Submissions:8173Accepted:2149DescriptionA catenym is a pair of words separated by a period such that the last letter of the first word is the same as the last letter of the second. For example, the following are catenyms:dog.gophergopher.ratrat.tiger 阅读全文
posted @ 2013-07-04 09:19 Jack Ge 阅读(295) 评论(0) 推荐(0)
2013年7月3日
POJ 2513 Colored Sticks （欧拉回路 + 字典树 +并查集）
摘要： Colored SticksTime Limit:5000MSMemory Limit:128000KTotal Submissions:27097Accepted:7175DescriptionYou are given a bunch of wooden sticks. Each endpoint of each stick is colored with some color. Is it possible to align the sticks in a straight line such that the colors of the endpoints that touch are 阅读全文
posted @ 2013-07-03 23:51 Jack Ge 阅读(463) 评论(0) 推荐(0)
HDU 3018 Ant Trip （欧拉回路）
摘要： Ant TripTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 904Accepted Submission(s): 338Problem DescriptionAnt Country consist of N towns.There are M roads connecting the towns.Ant Tony,together with his friends,wants to go through every part of the 阅读全文
posted @ 2013-07-03 23:10 Jack Ge 阅读(661) 评论(0) 推荐(0)
HDU 1023 Train Problem II （大数卡特兰数）
摘要： Train Problem IITime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4358Accepted Submission(s): 2391Problem DescriptionAs we all know the Train Problem I, the boss of the Ignatius Train Station want to know if all the trains come in strict-increasing o 阅读全文
posted @ 2013-07-03 22:44 Jack Ge 阅读(877) 评论(0) 推荐(0)
HDU 2067 小兔的棋盘 （卡特兰数）
摘要： 小兔的棋盘Time Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4665Accepted Submission(s): 2586Problem Description小兔的叔叔从外面旅游回来给她带来了一个礼物，小兔高兴地跑回自己的房间，拆开一看是一个棋盘，小兔有所失望。不过没过几天发现了棋盘的好玩之处。从起点(0，0)走到终点(n,n)的最短路径数是C(2n,n),现在小兔又想如果不穿越对角线(但可接触对角线上的格点)，这样的路径数有多少?小兔想了很 阅读全文
posted @ 2013-07-03 22:28 Jack Ge 阅读(596) 评论(0) 推荐(0)
HDU 3584 Cube （三维数状数组）
摘要： CubeTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 131072/65536 K (Java/Others)Total Submission(s): 1166Accepted Submission(s): 580Problem DescriptionGiven an N*N*N cube A, whose elements are either 0 or 1. A[i, j, k] means the number in the i-th row , j-th column and k-th layer. Initially we h 阅读全文
posted @ 2013-07-03 19:31 Jack Ge 阅读(390) 评论(0) 推荐(0)
HDU 2492 Ping pong （数状数组）
摘要： Ping pongTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2611Accepted Submission(s): 973Problem DescriptionN(3#include#includeusing namespace std;const int N=100010;int n,arr[N+10],a[N+10];int lmin[N+10],lmax[N+10],rmin[N+10],rmax[N+10];int lowbit( 阅读全文
posted @ 2013-07-03 18:55 Jack Ge 阅读(499) 评论(0) 推荐(0)
HDU 1556 Color the ball （数状数组）
摘要： Color the ballTime Limit: 9000/3000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5397Accepted Submission(s): 2882Problem DescriptionN个气球排成一排，从左到右依次编号为1,2,3....N.每次给定2个整数a b(a #include#includeusing namespace std;const int N=100010;int n,arr[N],level[N];int lowbit(int 阅读全文
posted @ 2013-07-03 17:02 Jack Ge 阅读(332) 评论(0) 推荐(0)
HDU 2227 Find the nondecreasing subsequences （数状数组）
摘要： Find the nondecreasing subsequencesTime Limit: 10000/5000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1072Accepted Submission(s): 370Problem DescriptionHow many nondecreasing subsequences can you find in the sequence S = {s1, s2, s3, ...., sn} ? For example, we assu 阅读全文
posted @ 2013-07-03 12:08 Jack Ge 阅读(275) 评论(0) 推荐(0)
上一页 1 ··· 5 6 7 8 9 10 11 12 13 ··· 56 下一页