Others

HungaryAlgorithm:   # Define n 1111int VX, Vy; // vertex set of the Bipartite Graph int graph [N] [N]; // The adjacent matrix int link [N]; /// number bool vis [N] of the vertex marked with Vy in VX; // whether the vertex marked with Vy has

/** Copyright (c) 2012, School of Computer Science, Yantai University * All Rights Reserved. * Author: Liu Mingliang * Completion Date: July 15, November 19, 2012 * version number: V1.0 * input Description: omitted * Problem description: Output a

/** Program Copyright and version description Section * copyright (c) 2012, Yantai University Computer college student * All rightsreserved. * file name: object. CPP * Author: Li Yang * Completion Date: July 15, March 22, 2013 * version: V1.0 *

1. Question link: Http://acm.hdu.edu.cn/showproblem.php? PID = 1, 1698   2. ReferenceCode:   # Include # define lson L, M, RT 1) * Col [RT]; sum [RT 1) * Col [RT]; Col [RT] = 0 ;}} void build (int l, int R, int RT) {Col [RT] = 0; sum [RT]

/**ProgramCopyright and version description Section * copyright (c) 2013, Yantai University Computer college student * All rightsreserved. * file name: riqi. CPP * Author: Li Yang * Completion Date: July 15, March 5, 2013 * version: V1.0 * input

/** Program Copyright and version description Section * copyright (c) 2012, Yantai University Computer college student * All rightsreserved. * file name: object. CPP * Author: Li Yang * Completion Date: July 15, March 23, 2013 * version: V1.0 *

Question link: http://acm.hdu.edu.cn/showproblem.php? Pid = 1, 1062 Question: Give a sentence and output every word in the lecture. Code: # Include # Include Int main (){Int I, j, n, m, len;Char a [1000];While (~ Scanf ("% d % * c", & n )){While (n -

Question link: http://acm.hdu.edu.cn/showproblem.php? Pid = 1, 2026 Refer to code 1: # Include # Include Int main (){Char s [101];Int I;While (gets (s )){For (I = 0; I {If (I = 0)S [I] = s [I]-'A' + 'a ';Else if (s [I] = '')S [I + 1] = s [I +

1. Question link: Http://acm.hdu.edu.cn/showproblem.php? PID = 1, 1596   2. Ideas: This topic is the problem of changing the shortest path. It indicates that the shortest path can also be used to obtain the maximum value (the maximum safety factor ).

Question link: http://acm.hdu.edu.cn/showproblem.php? PID = 1, 3808 Reference code: # Include Using namespace STD;Char A [11] [100] = {"Yu Jian", "Tin o", "I missed", "Stefanie", "the same", "about ", "Honey", "unfinished", "Hey Jude", "When

Question link: http://acm.hdu.edu.cn/showproblem.php? Pid = 1, 2203 Question: The meaning is clear. There are several methods. Reference code: # Include # Include Int main (){Char a [100001], B [100001], t [100001]; While (gets ()){Gets (B );

1. References: Cruise Karl AlgorithmKruskal Algorithm   2. Code implementation:   # Include # include using namespace std; int n, m, s; // n indicates the number of undirected graph vertices, and m indicates the number of edges, s is used to

1. Question:Description In Naruto, Yile ramen is the favorite of Naruto. Coincidentally, today is the day when the Naruto is promoted to a tolerable state (after so many years, he finally succeeded to endure =). He decided to take his friends to a

ACM has some tips during the question preparation process. 1. Generally, C language is used to save space. C ++ is used only when C ++ library functions or STL are used; Cout, cin, printf, and scanf should not be mixed. We recommend that you do not

1. Question link: Http://acm.hdu.edu.cn/showproblem.php? PID = 1, 1075   2. Question: according to the "Dictionary" provided, it can be understood by Mars.   3. Refer to code 1:   # Include # include # include char S1 [3000], S2 [3000]; struct

This is a concrete application of decomposition and combination in the summation of series. the essence of the split-item method is to break down each item in the series and then combine them to eliminate some items and ultimately achieve the goal

/** Copyright and version declaration section of the Program * Copyright (c) 2013, student * All rightsreserved from computer College of Yantai University. * file name: meiju. cpp * Author: Li Yang * Completion Date: July 15, March 13, 2013 *

1. Question link: Http://acm.hdu.edu.cn/showproblem.php? Pid = 1, 1754   2. Reference code:   # Include # include using namespace std; # define lson l, m, rt 1; build (lson); build (rson); PushUP (rt);} void update (int p, int add, int l, int r,

1. Question link: Http://acm.hdu.edu.cn/showproblem.php? Pid = 1, 3074   2. Reference code:   #include #define lson l,m,rt>1;build(lson);build(rson);PushUP(rt);}void update(int p,int c,int l,int r,int rt){if(l==r){ans[rt]=c;return ;}int

/* 02. * copyright and version Declaration of the program part 03. * Copyright (c) 2012, Yantai University Computer college student 04. * All rightsreserved. 05. * file name: object. cpp 06. * Author: Liu Mingliang 07. * Completion Date: April 8,