Algorithm--acm--popularization

Source: Internet
Author: User

TYVJ, Rqnoj, URAL, POJ, ZOJ, Hoj,noj , TYVJ

University of Beijing, Zhejiang University, the question Bank, Hangzhou Institute of

I. Basic algorithm:
(1) enumeration. (poj1753,poj2965)
(2) Greed (poj1328,poj2109,poj2586)
(3) The method of recursion and division.
(4) recursion.
(5) Construction method. (poj3295)
(6) Simulation method. (poj1068,poj2632,poj1573,poj2993,poj2996)
Two. Graph algorithm:
(1) Depth-first traversal and breadth-first traversal of graphs.
(2) Shortest path algorithm (Dijkstra,bellman-ford,floyd,heap+dijkstra)
(poj1860,poj3259,poj1062,poj2253,poj1125,poj2240)
(3) Minimum spanning tree algorithm (Prim,kruskal)
(poj1789,poj2485,poj1258,poj3026)
(4) Topology sequencing (poj1094)
(5) Maximum matching of binary graphs (Hungarian algorithm) (poj3041,poj3020)
(6) The maximum flow augmented path algorithm (km algorithm). (poj1459,poj3436)
Three. Data structure.
(1) string (poj1035,poj3080,poj1936)
(2) Sorting (fast, merge rows (related to reverse order number), heap rows) (poj2388,poj2299)
(3) Simple and check-set application.
(4) Hash table and binary search Efficient search method (number of hash, string of hash)
(poj3349,poj3274,poj2151,poj1840,poj2002,poj2503)
(5) Huffman tree (poj3253)
(6) Heap
(7) Trie tree (static achievements, dynamic Achievements) (poj2513)
Four. Simple search
(1) Depth-first search (poj2488,poj3083,poj3009,poj1321,poj2251)
(2) Breadth First search (poj3278,poj1426,poj3126,poj3087.poj3414)
(3) Simple search techniques and pruning (poj2531,poj1416,poj2676,1129)
Five. Dynamic planning
(1) knapsack problem. (poj1837,poj1276)
(2) Type of simple DP (refer to LRJ's book page149) as follows:
1.e[j]=opt{d+w (I,J)} (poj3267,poj1836,poj1260,poj2533)
2.e[i,j]=opt{d[i-1,j]+xi,d[i,j-1]+yj,d[i-1][j-1]+zij} (longest common sub-sequence)
(poj3176,poj1080,poj1159)
3.C[I,J]=W[I,J]+OPT{C[I,K-1]+C[K,J]}. (Optimal binary search tree problem)
Six. Mathematics
(1) Combinatorial mathematics:
1. Addition principle and multiplication principle.
2. Arrange the combination.
3. Recursion relationship.
(poj3252,poj1850,poj1019,poj1942)
(2) Number theory.
1. Prime number and division of integers
2. Binary bits.
3. Same comodule operation.
(poj2635, poj3292,poj1845,poj2115)
(3) Calculation method.
1. Two-point method to solve the monotone function related knowledge. (poj3273,poj3258,poj1905,poj3122)
Seven. Computational geometry.
(1) Geometric formula.
(2) The use of cross-product and dot product (such as the determination of intersection of segments, the distance from points to segments, etc.). (poj2031,poj1039)
(3) A multilateral type of simple algorithm (area) and related judgments (points in the multilateral type, whether the multilateral type intersect)
(poj1408,poj1584)
(4) Convex bag. (poj2187,poj1113)

Zhejiang University (ZJU):
Peking University (PKU): http://acm.pku.edu.cn/JudgeOnline/
Hangzhou (HDU): http://acm.hziee.edu.cn/
Tongji University (TJU): http://acm.tongji.edu.cn/
China University of Science and Technology (USTC): http://acm.ustc.edu.cn/
Harbin Institute of Technology (hit): http://acm.hit.edu.cn/
Hunan University (HNU): http://acm.hnu.cn:8080/online/
Tianjin University (TJU): http://cs.tju.edu.cn/acm/
Sichuan University (SCU): http://acm.scu.edu.cn/
Shantou University (STU): http://acm.stu.edu.cn/
Fuzhou University (Fzu): http://acm.fzu.edu.cn/
Xiamen University (XMU): http://acm.xmu.edu.cn/JudgeOnline/
Fujian Normal University (FJNU): http://acm.fjnu.edu.cn/
Huazhong University of Science and Technology (HUST): http://acm.hust.edu.cn/JudgeOnline/
East China Normal University (ECNU): http://acm.cs.ecnu.edu.cn/
Zhejiang University of Technology (ZJUT): http://acm.zjut.edu.cn/
Zhejiang Normal University (ZJNU): http://acm.zjnu.cn/
High-efficiency informatics online Problem Solving System (Vijos): http://www.vijos.cn/
Russia:
Ural University (URAL): http://acm.timus.ru/
Saratov University (SGU): http://acm.sgu.ru/
EL Judge (MIPT): http://acm.mipt.ru/judge/problems.pl
Spain:
Varadulid University (UVA): http://acm.uva.es/
United States:
Usaco:http://train.usaco.org/usacogate
Poland:
spoj:http://www.spoj.pl/
Kyrgyzstan:
Krsu:http://www.olymp.krsu.edu.kg/generalproblemset.aspx

Algorithm--acm--popularization

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.