Novice Village
Any great goal has a trivial beginning.
Luogu's first mission
Take the first step bravely and learn about language and Luogu. It will not be difficult to follow the books and teachers.
- P1000
- P1001
- P1421
- P1425
Order and branch
The intelligence of computers is beginning to be reflected because computers can be selected according to different conditions.
- P1422
- P1085
- P1089
- P1909
cycle! cycle! cycle!
What computers are most afraid of is repetition. If you ask it to do the same thing 10,000 times, it is not afraid of it, but if you ask it to do it 100 billion times...
- P1008
- P1035
- P1423
- P1424
- P1980
Array
The questions related to arrays basically use loops, so please complete 1-3 first.\(\color{black}:\)
- P1046
- P1047
- P1427
- P1428
- P2141
- P1567
Simple string
Computers can not only process numbers, but also text! It's actually nothing wrong with numbers.
- P1055
- P1200
- P1308
- P1553
- P1598
- P1914
Procedural functions and recursion
Packaging the code string is the process and function. The process and function calls themselves are recursive. There is a little difficulty, but don't be afraid.
- P1028
- P1036
- P1149
- P1217
BOSS Battle-Introduction Comprehensive Exercise 1
It will be a bit difficult to integrate the previous content here, but you can ask teachers and classmates, and you can also search for information online.
- P1478
- P1618
- P1579
- P2089
BOSS Battle-Introduction Comprehensive Exercise 2
The Warriors actually came to the boss's nest! Have a fierce battle to prove your strength and unlock the next level!
- P1426
- P1464
- P1014
- P1022
- P1307
Popular driving range
Popularizing the players in the group can sprint for training, and improving the players in the group can also consolidate the foundation here.
Simple simulation
Start popularizing group training! The so-called simulation is to write directly based on the meaning of the question, and the thinking is simple.
- P1003
- P1067
- P1540
- P1056
- P1328
- P1563
Cross-simulation
This is also a simulation, but there will be some other parts involved. It's not difficult to think, but it's a bit difficult to write.
- P1023
- P1031
- P1042
- P1086
- P1098
- P3952
Sort
Make the messy data regular. There are various sorting algorithms to use according to the situation.
- P1177
- P1059
- P1068
- P1781
Sort Ex
The sorting here is a step further. Not only does it combine other algorithms and techniques, but it also has various tricks in the sorting itself.
- P1583
- P1051
- P1093
- P1309
String processing
The string processing here will become more interesting and more difficult. Need to think carefully.
- P1603
- P1071
- P1012
- P1538
greedy
Greed is to consider only immediate interests. It is not good for us to be too greedy in life, but sometimes it is right.
- P1090
- P1181
- P1208
- P1223
- P1094
- P1803
- P1031
- P1080
Depth-first search
Search can exhaust all kinds of situations. Many questions can be completed by search. Even if you can't, searching is a trick to split the artifact.
- P1219
- P1019
- P1101
- P1605
- P1040
- P1092
Breadth-first search
Breadth priority search can be used to find questions about "shortest step count". Well, it can also be used for "carpet search".
- P1162
- P1032
- P1141
- P1126
- P1443
Search with tips
The search here not only includes dfs and bfs, but also includes techniques such as pruning and recording to speed up.
- P1118
- P1434
- P1433
- P1074
Dividing and consolidation algorithm
Split the big problems into small problems, divide them and conquer them, defeat them one by one, and then merge them back.
- P1226
- P1010
- P1908
- P1498
Simple math problems
It is perfect to use a computer to solve some troublesome math problems. This is a wonderful combination!
- P1088
- P1045
- P1403
- P1017
- P1147
- P1029
Recursive and Recursive Bind
Recursively, progressing layer by layer, pushing from the foundation to the top level. Binding can not only be used to find data, but also determine the most appropriate value.
- P1192
- P1025
- P1057
- P1135
- P1216
- P1182
- P1316
Linear data structure
Arrays, linked lists, queues, and stacks are all linear structures. Using these structures can do many convenient things.
- P1996
- P1115
- P1739
- P1160
- P1449
Tree data structure
A root node is forked, and the more it divides, it becomes a tree. Trees can represent the dependence between data
- P1087
- P1030
- P1305
- P5018
Dynamic planning backpack problem
This is the most basic dynamic planning. However, it will be a bit difficult to understand if it is the first time you come into contact. Come on, overcome this hurdle.
- P1060
- P1164
- P1064
- P1048
- P1049
- P1616
Linear dynamic programming
This is also the basic dynamic planning. It is a dynamic planning on linear structure, and you must master it.
- P1020
- P1091
- P1280
- P1880
- P1140
- P1282
Multidimensional dynamic programming
The dynamic planning here is more than one dimension. Not only should you be careful about time complexity, but you should also pay attention to space complexity.
- P1508
- P1006
- P1387
- P1417
- P1855
- P1736
More skills and memory
There are various ways to solve the problem here. Of course, some questions can also be used to reduce the difficulty of thinking.
- P1064
- P1541
- P1026
- P1063
- P1156
- P1052
High-precision algorithm
What should I do if long long (or int64) is not enough? Use high-precision algorithm. Do it yourself and have enough food and clothing.
- P1601
- P2142
- P1303
- P1255
- P1604
Greedy EX
Although it is a greedy problem, it may not be the greed you made at that time that you were greedy and messed with.
- P1080
- P1031
- P1233
- P2123
Simple Mathematics
Mathematics and OI are closely related. Mathematics is not only the foundation of OI, but also the core of algorithms.
- P1865
- P1372
- P1338
- P2158
- P1582
- P5678
BOSS Battle-Popular Comprehensive Exercise 1
After finally reaching this level, what are you waiting for? Take the guy up and get on!
- P1478
- P1203
- P1363
- P1736
BOSS Battle-Popular Comprehensive Exercise 2
Let's get the second boss. Although the battle is difficult, you must have no problem.
- P1201
- P1095
- P1058
- P2258
- P1108
BOSS Battle-Popular Comprehensive Exercise 3
The big boss who popularizes the driving range: "It will definitely make you go but not return." What to do? You can only defeat him and open the next level!
- P1328
- P1062
- P1969
- P1037
Popularize common templates
Here are templates for relatively basic algorithms. There are also template questions for improving and provincial selection!
- P1177
- P3366
- P3367
- P3371
- P3383
Improve your experience
If the difficulty of popularization group has been removed, please rest assured. When you grow up, you must write questions! ! !
Search Ex
Start the trial of improving the group. All questions about the difficulty of popularization groups have been removed here. Humph, you're scared. .
- P1120
- P1378
- P1514
- P1312
- P1441
- P1242
Dynamic Programming (1)
This is a relatively basic dynamic programming in improving the difficulty of the group. Perhaps one or two transfer equations can be written.
- P1005
- P1373
- P2279
- P1220
- P1156
Dynamic Programming (2)
The dynamic programming here is a little more difficult, and the time to think about the transfer equation may be the same as the time to write the program.
- P1273
- P1169
- P2577
- P1070
- P2051
Dynamic Programming (3)
Comparison of dynamic planning that requires skills. Some not only require state transition equations, but may also be integrated with other algorithms.
- P1415
- P2157
- P2216
- P2331
- P2467
- P3084
Number Theory
Number theory is the theory of studying integers. Including common multiples, prime numbers, Euler's theorem and concomitant equations, etc.
- P2152
- P1414
- P1134
- P1313
- P1306
Game Theory
Game theory considers the predictive and actual behavior of individuals in the game and studies their optimization strategies.
- P1199
- P1288
- P1290
- P2148
- P1247
- P2575
Other mathematical problems
I heard that comrades who are studying OI are all good at math. So. Please complete the following questions to prove this!
- P1357
- P1641
- P2059
- P2154
- P2261
- P2327
- P1066
The traversal of the picture
Graphs are a very important data structure that describes complex exercises of objects. Here we start to get to know the basic concepts of the diagram.
- P2661
- P1330
- P1341
- P2921
Shortest circuit problem
The shortest circuit is the most important part of graph theory, and a variety of algorithms can be applied. Many questions can be abstracted into this model.
- P1339
- P1462
- P1346
- P1119
- P1144
- P1522
Minimum spanning tree
The minimum spanning tree can be found using the kruskal algorithm or the prim algorithm.
- P1546
- P2330
- P1991
- P1265
More complex graph theory I
Other graph theory issues include trees, topological sorting, etc. To pass this level, you need to learn a lot of new algorithms.
- P1113
- P1268
- P1525
- P1983
More complex graph theory II
More advanced graph theory algorithm. Including differential constraints, strong connectivity, binary graphs, etc. It will be more difficult.
- P1993
- P1726
- P2055
- P2149
- P1345
And check the collection
Used to deal with merging and querying problems of some non-intersecting sets. It is often expressed as a forest in use.
- P1111
- P2024
- P1197
- P1196
heap
The heap is always a complete tree; the value of a node in the heap is always no greater than or less than the value of its parent node.
- P1801
- P2278
- P1631
- P2085
- P1484
Line segment tree-like array foundation
These are all relatively advanced linear data structures. It is very useful when dealing with some inquiries and modifications to linear problems.
- P1972
- P1198
- P2023
- P2161
A magical solution
Some problems were not available at first. Think about it carefully and try not to read the problem solution, otherwise you will shout "simple".
- P1007
- P1984
- P2022
- P2320
- P7909
Double
A special enumeration algorithm, but can greatly speed up efficiency. I have passed the Noip test in recent years. It's more difficult.
- P1967
- P1081
- P1613
Strong connected components
Strong connected components
- P2341
- P3469
- P2746
- P3119
- P3225
BOSS Battle-Improvement Comprehensive Exercise 1
Young man, another one is here to the door, let me see your real skills. Ah hahahahahaha!
- P2264
- P1772
- P1083
- P1979
- P2939
BOSS Battle-Improvement Comprehensive Exercise 2
Come again! The questions here do not simply examine a certain algorithm, but rather examine a comprehensive thinking.
- P1901
- P1314
- P2144
- P1073
- P2324
BOSS Battle-Improvement Comprehensive Exercise 3
Since the first two bosses have been defeated, there is no problem with the third one. Boy, come on!
- P1965
- P1311
- P2296
- P1084
Improve template-nlogn data structure
Although these algorithms are not necessary for noip, they are not difficult, and many questions can use these methods.
- P3374
- P3368
- P3372
- P3373
- P1439
- P3378
Provincial Colosseum/NOI Temple
A training ground for provincial and above players. In fact, the Oier with the lowest selection level does not require some additional question-writing list. This column is for reference only, and you are welcome to point out the shortcomings.
Basics of provincial selection-read in/output optimization
Read-in/output optimization is a necessary thing when choosing questions for the use of the questions. Here are a few questions that you need to write by hand to the corresponding read-in/output processing. As the first level, this level is relatively simple.
- P1580
- P2393
- P2394
Provincial selection basics-bit operation
Bit operation can often lead you to optimize constants when necessary, maybe space; maybe time; sometimes this can be more than a lot of points.
- P2114
- P2396
- P2397
Basic selection of provinces - table
Although it is very sloppy in the table, and it is basically non-standard, this method allows us to get some data points that will time out or exceed the space in the province.
- P1149
- P1463
- P1896
Dynamic Programming 1
Dynamic planning
- P2051
- P1879
- P1850
- P2831
- P1131
- P1169
Dynamic Programming 2
Dynamic planning
- P1273
- P3648
- P2519
- P2515
- P3233
- P2501
Network flow-maximum flow
Maximum flow
- P2765
- P2764
- P2763
- P2766
- P2774
- P2805
Network flow-cost flow
Fee flow
- P2153
- P2053
- P3159
- P2604
- P2050
- P3980
Monotonous queue
Monotonous queue
- P2698
- P2216
- P2219
- P2564
- P2569
Probability Expectation
Probability Expectation
- P2473
- P2221
- P3317
- P3343
- P3600
- P3830
Bipartite graph
Bipartite graph
- P3386
- P1640
- P1129
- P1963
- P3231
- P2526
Point-to-part
Point-to-part
- P2634
- P2664
- P3806
- P3676
Suffix array
Suffix array
- P3809
- P1117
- P2178
- P2463
- P2336
Chairman tree
Chairman tree
- P2468
- P3157
- P3302
- P3168
- P3313
Digital DP
Digital DP
- P2602
- P3281
- P2518
- P2606
AC automatic machine
AC automatic machine
- P3808
- P3796
- P2444
- P2414
Balance tree
Balance tree
- P2042
- P2596
- P1110
- P3285
- P3644
- P3765
- P3369
Tree chain segmentation
Tree chain segmentation
- P2590
- P2486
- P2146
- P3258
- P3178
Dynamic Tree
Dynamic Tree
- P3690
- P2387
- P3203
- P3348
Trees
Trees
- P1903
- P3157
- P3332
- P2166
- P3380
- P2137
- P3759
Persistible Trie Tree
Persistible Trie Tree
- P2048
- P3527
- P3302
- P3168
- P3242
- P3241
- P3293
Team Mo's algorithm
Team Mo's algorithm
- P1972
- P2336
- P3709
- P2709
- P3674
Partition
Partition
- P1972
- P3396
- P1822
- P2801
- P3203
Mobius inversion
Mobius inversion
- P3768
- P3172
- P3455
- P2522
- P3327
other
other
- P3377
- P3261
- P3382
- P2571
- P3222
- P3187
- P3199
- P3292
- P2824
- P3285
- P1552
USACO
The classic American algorithm exercise bank is worth a look
USACO Section 1.1
- P1200
- P1201
- P1202
- P1203
USACO Section 1.2
Completely enumerated
- P3864
- P1204
- P1205
- P1206
- P1207
USACO Section 1.3
greedy
- P1208
- P1209
- P1211
- P1444
- P3650
- P2693
USACO Section 1.4
Skilled enumeration
- P1214
- P1215
USACO Section 1.5
Binary number
- P1216
- P1217
- P1218
USACO Section 2.1
Graph Theory and Flood Fill
- P1457
- P1458
- P1459
- P1460
- P1461
USACO Section 2.2
Data structure and dynamic programming
- P1465
- P1466
- P1467
- P1468
USACO Section 2.3
- P1470
- P1472
- P1473
- P1474
- P1475
USACO Section 2.4
Shortest path
- P1518
- P1519
- P1522
- P1478
- P1529
- P1530
USACO Section 3.1
Minimum spanning tree
- P1546
- P2722
- P2723
- P2724
- P2725
USACO Section 3.2
Backpack problem
- P1134
- P2727
- P2728
- P2729
- P2730
- P1828
USACO Section 3.3
Euler Circuit
- P2731
- P2732
- P1930
- P2733
- P2734
USACO Section 3.4
Calculate geometry
- P1827
- P2735
- P2736
USACO Section 4.1
Optimized
- P2737
- P2738
USACO Section 4.2
Network flow
- P2740
- P1894
- P2751
USACO Section 4.3
High precision
- P2687
- P2752
- P2753
USACO Section 4.4
- P1344
- P2739
- P2741
USACO Section 5.1
Two-dimensional convex hull
- P2742
- P2743
- P2749
USACO Section 5.2
- P1560
USACO Section 5.3
Heuristic Search
- P2701
- P2744
- P2745
- P2746
USACO Section 5.4
- P1345
- P2747
- P2748
USACO Section 5.5
- P1709
- P1856
- P2750