Others

POJ-1204-Word puzzles. Http://poj.org/problem? Id = 1204 Dictionary tree deep search # Include # include # include # include using namespace STD; char map [1005] [1005]; int N1, N2; int XX, YY; int dirx [8] = {-1,-,-1}; int diry [8] = {, 0,

# Include # include # include # include // # define input/** problem: grids2418-Hardwood Species begin time: P. m. 29th/2/2012 end time: 21:35:04 cost time: 2 hours 5 mins idea: it is a process of simulating Map . For details, see the following

ZOJ-3641-Information sharing Http://acm.zju.edu.cn/onlinejudge/showProblem.do? Problemcode = 3641. Each person has several pieces of information, and the information of different people can be shared and queried. # include # include

HDU-1253-victory Http://acm.hdu.edu.cn/showproblem.php? PID = 1, 1253 Simple 3D BFS # Include # include # include # include # include # include using namespace STD; char visit [52] [52] [52]; char map [52] [52] [52]; int A, B, C;

POJ-1679-The Unique MST. Http://poj.org/problem? Id = 1679 A small number of trees are generated, and the prim changes slightly. Each time a new vertex is added, if there is more than one shortest edge with the smallest weight value, it means that

POJ-1273-Drainage Ditches. Http://poj.org/problem? Id = 1273 Basic maximum stream, Ford-Fulkerson Algorithm, written in LRJ white # Include # include # include using namespace std; # define INF 0x7fffffffint main () {int n, m; int from, to, w, f;

Question address: Http://acm.hdu.edu.cn/showproblem.php? Pid = 1, 2717 In this case, we need to pay special attention to the hard drive of HDU. On POJ, it is single-group data, multi-point test, HDU is one-point test, and multiple groups of data!

# Include # include # include /* Reference: http://www.cnblogs.com/youngxiao/archive/2010/05/19/1739381.html.THX a lot to you. author: YuXun Lu (A.K. A Kyle Broflovlaski) problem: poj2796 Begin Time: 13: 00 p. m. 2/18/2012 End Time: About 4 hours

POJ-2226-Muddy (Fields) Http://poj.org/problem? Id = 2226 A piece of wood can cover a row or a column of land. The wood blocks are laid by row and then by column. *. *. By Row 1 0 2 0 by column 1 0 4 0 . *** 0 3 3 3 0 3 4 5 * **. 4 4 4 0 2 3 4 0 .. *

# Include # include # include # include // # define INPUT // # define DBG/** Begin Time: 5: 00 p. m. 1st/3/2012 End Time: p. m. 1st/3/2012 Cost Time: 3 Hours 2 Mins test data: No ...... Idea: Read Six numbers first, sort these six numbers, and

# Include # include # include # include // # define INPUTusing namespace std;/** Problem: ZOJ1649-Rescue Begin Time: 7: 00 p. m. 17th/Mar/2012 End Time: 17th/Mar/2012 Knowledge, instead of clicking r to find a mobile, follow the general Deep

#include #include #include #include #include #include using namespace std;const int HASH_SIZE = 1000000;const int HASH_KEY = 17;int next[HASH_KEY][HASH_SIZE];int hash[HASH_SIZE];int origin_nums[HASH_SIZE];int now = 1;int comp(const void *a,const

HDU-2717-Catch That Cow Http://acm.hdu.edu.cn/showproblem.php? Pid = 1, 2717 Basic BFS, search in three directions #include#include#include#include#includeusing namespace std;int n,k;char visit[100005];struct node{int x;int time;};int go(int x){if(0

HDU-1258-Sum It Up Http://acm.hdu.edu.cn/showproblem.php? Pid = 1, 1258 Note that each number can be used only once, and duplicate equations cannot appear. # Include # include # include int a [20], ans [20]; int sum, n, flag; void dfs (int x,

9-degree OJ-1172-Harman tree Http://ac.jobdu.com/problem.php? Pid = 1, 1172 Huffman tree: given n weights as n leaf nodes, a binary tree is constructed. If the length of the weighted path reaches the minimum, such a binary tree is called the

POJ-1486-Sorting Slides Http://poj.org/problem? Id = 1486 The coordinates of some Rectangles and some vertices are given. If a vertex is in a rectangle, the vertex matches the rectangle and asks if a match exists in all perfect matches, this

HDU-1501-Zipper Http://acm.hdu.edu.cn/showproblem.php? Pid = 1, 1501 Basic DFS. Note that the status you have searched must be marked, otherwise it will time out. #include#include#includechar str1[205],str2[205],str3[405];int flag;int len1,len2,len3

HDU-1565-Number of squares (1) Http://acm.hdu.edu.cn/showproblem.php? Pid = 1, 1565 My first state compresses DP Give you a checkboard of n * n. Each checkboard contains a non-negative number, and several numbers are extracted from it, so that any

A. Cakeminatortime limit per test 1 secondMemory limit per test 256 megabytesInput Standard inputOutput Standard output You are given a rectangular cake, represented asRLimit × limitCGrid. Each cell either has an edevil strawberry, or is empty. For

IME HDU-4287-Intelligent Http://acm.hdu.edu.cn/showproblem.php? Pid = 1, 4287 Start to use dictionary tree + deep search, timeout .... Later, we found that the question can contain a maximum of six digits. We can convert the string into a