National training Team paper sorting and sorting

Source: Internet
Author: User

Combinatorial mathematics Counting and statistics 2001-Fu Wenjie: The principle of Pólya and its application
2003-Xu Zhilei: On the application of the idea of complementary set transformation in statistical problems
2007-Dong Zhou: "Count of spanning tree and its application"
2008-Chen Yuhi "The application of Pólya counting Method"
Digital issues 2009-Gao Yihan Study on the solution of digital counting problem
2009-Liu Cong "a brief discussion on the statistics of digital category"
Dynamic statistics 2004-Shire: Two razor blades for solving dynamic statistical problems
2007-Yu Jiangwei: "How to solve the dynamic statistics problem"
Game 2002-Zhang Yifei: From perceptual knowledge to rational cognition--the process of solving a class of game games
2007-Wang Xiaoke: An analytic class of combined games
2009-Cao Chinxiang on "K-fold dynamic subtraction game" to explore a class of combinatorial game problems
2009-Fang on how to solve the problem of unequal game
2009-Jia Zhihao "a brief discussion on combinatorial games--on the development and transformation of SG Games"
Female function 2009-Mao Jiming "The properties and applications of female functions"
Quasi-array 2007-Liu Yuchen: Preliminary study on quasi-matrices
Linear programming 2007-Li Yu-yu: On the linear programming in the competition of informatics--simple and efficient simplex method realization and application
Permutation group 2005-Pan Zhenhao: Research and discussion on fast power operation of permutation group
Quiz interaction 2003-Gaozhengyu: The answer is only one--on the question of question-and-answer interaction
Guessing the number of questions 2003-Zhang Ning: The study of the problem of guessing:< intelligent students > The promotion of a problem
2006-Ronfain: A study of a kind of guessing problem
Data Data 2005-Helin: The simplification of data relations
2006-Chenguang Zhu: The application of basic data structure in informatics competition
2007-He Sen: on the rational organization of data
2008-Cao Chinxiang "data structure extraction and compression"
Structure Union 2001-Alpine Core: The comprehensive application of data structure from the round table problem
2005-Gang: The union of data structures
Block Linked list 2005-Huatin: The combination of data structure--block list
2008-Su Yu "a little research on blocky lists"
Dynamic tree 2006-Chen Shouan: Maintenance of forest connectivity-dynamic tree
2007-Shing: "Dynamic tree and its application"
Left-leaning tree 2005-Huangyuan: Characteristics and application of left-leaning tree
Skip Table 2005-Wei: "Let the efficiency of the algorithm" Jump Up! --on the related operation and application of "jumping table"
2009-Li Yu yang "line jump table-jump table of an extension"
SBT 2007-Chen Qi: "Size Balance Tree"
Segment Tree 2004-Lin Tao: The Application of Segment tree
Monotone queue 2006-Yuzawa: An analysis of the application of queues in a class of monotonic problems
Hash table 2005-Li Yu: "Optimization of hash function design"
2007-Yang Yi: A kind of application of hash in the informatics competition
Splay 2004-Yang Siyu: The basic operation and application of the stretching tree
Graph theory Graph theory 2005-Ninge: The basic thought and method of graph theory
Model Building 2004-Huangyuan: "On the establishment and application of graph theory model"
2004-Tian Xiao: "The thought of layered graph" and its application in the competition of informatics
Network flow 2001-Jiangpeng: A tentative discussion on the construction and algorithm of network flow from the solution of a problem
2002-Kai Jin: On the application of network flow algorithm
2007-Hubertau: The application of the minimum cut model in the informatics competition
2007-Wang Xin: On the network flow algorithm based on layered thought
2008-dong Zhou The two poles connecting--analysis of the application of maximum-minimum theorem in the competition of informatics
Shortest circuit 2006-Yu Yuanming: "Shortest path algorithm and its application"
2008-Lu Zi "on the stratification thought in the shortest path problem"
2009-Kangbino "optimization and application of SPFA algorithm"
Euler Road 2007-Shang: A study of the properties and applications of the European pull loop
Differential constraint system 2006-Feng Wei: The perfect combination of numbers and graphs--an analysis of differential constraint systems
Floor plan 2003-Liu Cailiang: The application of floor plan in informatics
2007-Ancient Nan: "Plane embedding"
2-sat 2003-Woo Jun: The problem of the 2-sat of symmetry
Minimum spanning tree 2004-Wu Jingyue: "Minimum spanning tree algorithm and its application"
2004-Wang Ding: The development of the minimum spanning tree problem
Two-part diagram 2005-Wang June: An analysis of the application of binary mapping in the competition of informatics
Voronoi Chart 2006-dong: An analysis of the structure and application of plane Voronoi diagram
Even graphs 2002-Sun Fangcheng: Algorithms and applications of even graphs
Tree Tree 2002-Zhou Wenshu: The application of tree structure in program design
2005-Li Shi: "The Garden of the trees-some topics related to trees"
Path problem 2009-Lacquer Super "application of divide-and-conquer algorithm in tree path problem"
Recent Public Ancestors 2007-Guohua Yang: The problem of RMQ and LCA
Partitioning issues 2004-Pui FAI: The analysis of the Division of Trees
Arithmetical Euclidean algorithm 2009-Jin Bin "Euclidean algorithm Application"
Congruence equation 2003-Jiangshang Servant: The application of modal linear equations--solving integer Problems by number theory method
Search Search 2001-骆骥: "Car problem" on one aspect of deep search--The importance of search object and strategy
2002-Wang Zhiqun: "Selection of search order"
2005-Wang Ding: The application of parametric search
Heuristic 2009-Commemoration into the application of valuation function in the competition of informatics
Optimization 2003-Kai Jin: Exploring the optimization techniques in depth-first search--a discussion on the problem of square split
2003-Liu Yishui: The optimization idea of a kind of search--data ordering
2006-Xiaoyu: Optimization techniques for depth-first search problems
Knapsack problem 2009-Xu Xianheng "A brief discussion on several kinds of knapsack problems"
The 2004-Loutian: The ingenious use of matching algorithms in search problems
Probability Probability 2009-Meshike on the solution of probability problem in the contest of informatics
Mathematical expectations 2009-Soup may be due to "analysis of the solution of a class of mathematical expectation in competition"
String String 2003-Zhou Yuan: An analysis of the application of the thought of "minimal representation" in the problem of string-loop isomorphism
Multi-string matching 2004-Zhu Zehian: "Multi-string matching algorithm and its revelation"
2006-Wang Yun: The construction, utilization and improvement of Trie map
2009-Donghuazing "An analysis of the application of letter trees in the competition of informatics"
Suffix array 2004-Xu Zhilei: "Suffix array"
2009-Ro "suffix array-powerful tool for handling strings"
String match 2003-Lao Xiangrong: DNA ——— Analysis of a character matching problem parsing process
2003-Linchde: "Max repeat substring"
Dynamic planning Dynamic planning 2001-Youming: The expansion of basic dynamic programming issues
2006-Huang: "Greedy dynamic planning"
2009-Xu Yuansheng "research on a class of dynamic programming Problems"
State compression 2008-Chen Danqi "Dynamic programming problem based on connectivity state compression"
State design 2008-Liu Yi "on the rational design and application of state in informatics"
Tree-shaped DP 2007-Chen Yuhi: Creative thinking in multi-angle thinking--a probe into the thinking and method of solving problems by using tree-type dynamic programming
Optimization 2001-Maoziqing: Optimization techniques for dynamic programming algorithms
2003-Xiang: "Making full use of the nature of the problem"--an analysis of the "individualized" optimization of dynamic programming
2004-Chenguang Zhu: Optimize, re-optimize! --An analysis of the optimization of dynamic programming algorithm from the problem of Eagle Egg
2007-Yang Zhe: Strengthening and application of convex complete monotonicity
Calculate geometry Solid geometry 2003-Lucho: "Cuboid volume and"
2008-Gao Yitao "reducing programming complexity from the perspective of stereo geometry problems"
Computational geometry thought 2004-kai Jin: The Limit Method-a shortcut to solving geometric optimization problems
2008-Cheng "dichotomy in computational geometry"
2008-Guo on the application of stochastic thinking in geometrical problems
Round 2007-Gao Yihan: "discretization related to The circle"
Semi-planar Cross 2002-Li Ying: "Semi-planar intersection algorithm and its application"
2006-Zhu Zehian: A new algorithm of semi-planar intersection and its practical value
Matrix Matrix 2008-Hu Huacheng the application of matrix multiplication in informatics
Gaussian elimination element 2002-He Jiangzhou: "Solving linear equations with Gaussian elimination method"
Mathematical Methods Mathematical thought 2002-Helin: "Conjecture and its application"
2003-Shore: "Math Ideas help You"
Mathematical Inductive method 2009-Zhang Kunwei "Mathematical induction and the way to solve problems"
Polynomial 2002-Zhang Jialin: "Polynomial multiplication"
Combination of numbers and shapes 2004-Zhou Yuan: "The application of the thought of combination of numbers and form in the competition of informatics"
Gold Division 2005-Yang Siyu: Beauty, ubiquitous--on the relationship between "golden section" and informatics
Other algorithms Genetic algorithm 2002-Zhang Ning: the characteristics and application of genetic algorithms
2005-Qianzhiang: "Analysis and research on genetic algorithm application"
Information 2003-Hou Qiming: The simple application of information theory in the competition of informatics
Dyeing and construction 2002-Yang Yanji: The construction Method-the shortest path of solving problems
2003-Fonzie: The application of staining and construction methods on the chessboard
A class of questions Interval 2008-Zhou Xiaobo "on the interval problem in the competition of informatics"
Order 2005-Ronfain: Application of the preface
System 2006-Wang Ye: Reference system and coordinate system in informatics
Physical problems 2008-Fango "An analysis of physics-related problems in the competition of informatics"
Coding and decoding 2008-Zhou Mengyu--on the way of yards--on coding and decoding in the competition of informatics
Countermeasure issues 2002-骆骥: Two ways to analyze the problem of "solution"
Optimization Algorithm optimization 2002-Sun Linchun: "Let's do better--Talk about program optimization from Solution"
2004-Hu Weidong: "Reducing Redundancy and algorithm optimization"
2005-Yang Yi: The optimization of algorithm in the solution of < small H's Hut >
2006-Jiayu: Optimization of algorithm analysis by graph theory
Program Optimization 2006-Zhou Yisu: On the application of disassembly in the optimization of time constants
2009-Cochang "Some methods and techniques for the optimization of the bottom of procedure"
Language C++ 2004-Han Wenxian: On the application of C + + language in the competition of informatics
Strategy Strategy 2004-Lirui Zhe: "The details-the elements that cannot be ignored"
2005-Zhu Zehian: "Back to the beginning-a breakthrough thinking"
2006-Chen Qi: The application of the method of "making and relaxing" in solving problems
2006-Li Tianyi: "From special circumstances considerations"
2007-Chenxue: The change and the constant in the problem
2008-Shohan on "deep" and "wide" in the analysis of the competition of informatics
Double 2005-Chenguang Zhu: An analysis of the application of multiplication thought in the informatics competition
Two points 2002-Li Rui: The dichotomy and statistical issues
2002-Xu Zhilei: Two points, two points! --from mobiles (IOI2001) A question to see the multiplicity of two points
2005-June Yang: The application of the dichotomy strategy in the informatics competition
Adjustment 2006-Wenbin Tang: The Application of "adjustment" thought in informatics
Randomization 2007-Liu Jia: On the application of randomization in the contest of informatics
Non-perfect algorithm 2005-Hu Weidong: An analysis of the application of imperfect algorithm in the competition of informatics
2008-Ning: A preliminary study of imperfect algorithms
Submit Answer question 2003-Rei: The question of the result submission class
Conservation thought 2004-Helin: The Application of conservation law in informatics
Limit method 2003-Wang Zhiqun: On solving the problem of maximal sub-rectangles with the idea of maximizing
Greedy 2008-Gao Yihan the application of partial greedy thought in the informatics competition
Compression method 2005-Zhou Yuan: "Squeezing out redundant condensed essence"--on "compression method" in the competition of informatics
Reverse Thinking 2005-Wenbin Tang: "It is difficult to reverse--talking about the application of Converse thinking in solving problems"
Poor lift 2004-Tripod Censer: On the application of special and exhaustive thoughts
Target Conversion 2002-Dade: A step back to the sky--some applications of "idea of goal transformation"
2004-Li Shi: The application of transformation target in solving problems
Analogy 2006-Zhou Golin: "A brief talk on analogy thought"
Split and merge 2006-Yu Xin: The chessboard in the chessboard--on the thought of dividing the chessboard
2007-Yang Yi: A brief analysis of "division" and "Hopewell" in Informatics
Balanced thinking 2008-Zheng "Balanced planning--an analysis of the application of a kind of balance thought"

National training Team paper sorting and sorting

Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: info-contact@alibabacloud.com and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.