Others

Http://acm.hdu.edu.cn/showproblem.php? PID = 1, 1054 # Include # include # include using namespace STD; struct arcnode {int adjvex; arcnode * Next; arcnode (): adjvex (-1 ), next (0) {}}; struct vnode {arcnode * First; vnode (): First (0) {}};

Http://acm.hdu.edu.cn/showproblem.php? PID = 1, 1350 /*************************************** * *********************************> File Name: main. CPP> author: huangshuai> mail: huangshuai1993@gmail.com> created time: sat 09 mar 2013 08:36:13

Attention should be paid to details such as whether there are any important points and whether there are colons ~~ Consider, # Include # include # include # include # include using namespace STD; struct node {int X, Y ;}; node Vex [1000];

Board partitioning Time Limit: 2000/1000 MS (Java/others) memory limit: 32768/32768 K (Java/Others)Total submission (s): 327 accepted submission (s): 162Problem description splits an 8*8 board into the following parts: Cut the original Board into a

Link: http://poj.org/problem? Id = 1068 http://acm.hust.edu.cn/vjudge/contest/view.action? Cid = 27454 # Problem/bparencodings Time limit:1000 ms   Memory limit:10000 K Total submissions:17044   Accepted:10199

Several DP Statements were made over the past two days. Let's review them. 1, http://acm.hdu.edu.cn/showproblem.php? PID = 1, 1024 DP [I] [J] indicates that the first J numbers include the maximum values divided by the J-selected I segments. DP [I] [

Original article: 10Steps to becoming the developer everyone wants Author: Andrew C. Oliver Translation: how developers can improve and promote themselves Translator: wangguo Writing great code has reached a level for developers. But continuous

Every career will belong to a certain stage during its growth, with confusion and hope. As a programmer, you can compare to what kind of realm. This article will show you right.First important: In which computer magazine I saw the Software

As mentioned in the previous article, the key to salary increase lies in "you can do things that others cannot do 』. Programmers are the people who deal with machines all day long. In the age when computers were not widely used, there was no doubt

Http://acm.hdu.edu.cn/showproblem.php? PID = 1, 4160 # Include #include # include using namespace STD; struct node {int WI, Li, hi ;}; node A [505]; int map [505] [505]; int N; int link1 [505]; int vis [505]; void fit () {int I, j; for (I = 0; I

Amount of the first line ~~ # Include # include # include # include using namespace STD; int map [555] [555]; int flag [555]; int link1 [555]; int n, m; int can (int I) {Int J; For (j = 1; j

Link: http://poj.org/problem? Id = 1694 http://acm.hust.edu.cn/vjudge/contest/view.action? Cid = 27454 # Problem/EAN old stone game Time limit:1000 ms   Memory limit:10000 K Total submissions:3132   Accepted:1422

This question is very similar to 3081. n + 1 ---- n + 1 + M creates an edge with a capacity of K, if map [I] [J] = 1, create an edge with an I --- N + M + J Capacity of 1. Otherwise, create an edge with an I ---- N + J Capacity of 1 and then divide

Treasure hunting Time Limit: 4000/2000 MS (Java/others) memory limit: 131072/65536 K (Java/Others)Total submission (s): 903 accepted submission (s): 228Problem descriptiondo you like treasure hunting? Today, with one of his friend, ISEA is on a

Http://acm.hdu.edu.cn/showproblem.php? PID = 1, 4309 Look at others' reports ~~ I think binary enumeration is clever. I learned it ,.. #include #include #include #define MAXN 2000#define MAXM 20000#define inf 0x3f3f3f3fusing namespace std;struct

My brute Time Limit: 2000/1000 MS (Java/others) memory limit: 32768/32768 K (Java/Others)Total submission (s): 492 accepted submission (s): 180Problem descriptionseaco is a beautiful girl and likes play a game called "My brute ". before Valentine's

Http://acm.hdu.edu.cn/showproblem.php? PID = 1, 2448 It's similar to the one who came home on the map ~~~ There is no direction between stations, and the port and station are directed, because they cannot come in. Create a cost flow

Task scheduletime limit: 2000/1000 ms (Java/other) memory limit: 65536/32768 K (Java/other) total submission (s): 71 accepted submission (s ): 20 problem descriptionour geometry princess XMM has stoped her study in computational geometry to

Spoj problem set (classical) 13041. The black ridersproblem code: amr12a  'Hush! 'Said Frodo. 'I think I hear hoofs again. 'They stopped suddenly and stood as silent as tree-shadows, listening. there was a sound of hoofs in the lane, some way

Link: http://poj.org/problem? Id = 2485 http://acm.hust.edu.cn/vjudge/contest/view.action? Cid = 22010 # Problem/hhighways Time limit:1000 ms   Memory limit:65536 K Total submissions:18668   Accepted:8648