Sicily question category

Sicily question category (transfer)
Copyright Disclaimer: During reprinting, please use hyperlinks to indicate the original source and author information of the article and this statement
Http://escorter.blogbus.com/logs/36310253.html

 

[Data Structure/Graph Theory]

1310 right-heavy tree Cartesian tree correlation, complexity O (n) or O (nlogn ).
1426 phone list phone number prefix search, related to the trie tree.
1443 basic queue operations for printer queue.
1149 determine whether an equivalent expression is equivalent (recursive)
In the 1136 mountain sea longitude n long sequence, the maximum continuous subinterval sum of m intervals is obtained. Line Segment tree/rmq

1252 defining moment string pre-division suffix
1194 message flood word search. Binary Search after sorting
1201 01000001 large integer binary Addition
1381 a * B High-Precision Multiplication
1424 bonus Topology Sorting
1350 piggy banks gives a directed graph with a 1-point degree output, and calculates the number of rings. (Simple)
1423 the two-color theorem diagram of the Devil bug finds the minimum cut of the network.
1173 reliable nets returns the smallest two-connected subgraph in an undirected graph. (Small data can be searched)
1192 guardian of decency: Calculate the largest independent set. If it is special, it can be converted to binary matching.
1031 campus single-source shortest path, Dijkstra.
1090 highways Minimum Spanning Tree.
1034 forest definition, calculate the maximum width and depth. (Depth-first traversal)
1114 the breadth of food cubes first traverses the three-dimensional space graph. (DFS is prone to stack overflow)
1132 routes uses a sequence of parentheses to represent the tree and finds the closest common ancestor of two nodes.
1155 can I post the letter to determine whether two points are reachable. (Graph traversal)
1141 the number of methods for generating the tree at the minimum in the monkey battle full graph. All nodes are arranged in the order of n! * (N ^ (n-2 ))
1170 countdown achievements, statistics
1196 conversion of Conflict Relationship Closure
1210 binary tree knows the number of possible methods in the forward and backward order
1402 panic room diagram: Maximum Network Flow
1303 Maximum Weight Matching of job assignment Bipartite Graph
1308 dependencies among jobs graph traversal.

[Ry]

1175 swamp things Plane n points, find a straight line that goes through the most points.
1234 playground semi-circle can constitute a closed circle. Map, convert to determine whether a polygon can be formed

1179 extrusion Polygon Area
1045 space management: calculates the total area of the rectangle stacked on the plane. The rectangle is cut or discretization.
1092 stars in your window line segment tree.
1145 tree discretization out of school or O (n) Scanning
1223 the defensive force field seeks a line with a forward coordinate point to minimize the points on one side of the line
1216 the Shortest Path of the field marching
1118 war on weather: the outer point of the ball is directly determined by the ball tangent.

[Search]

1444 prime path breadth-first search
1317 Number of sudoku Sudoku solutions.
1171 the game of EFIL 2 ^ 16 DFS enumeration board Detection
1219 new red/black tree cutting-tree game, min-max search or memory search
1215 remove the restricted maze from the dungeon and seek the minimum steps for the two to meet each other. (Breadth-first search)
1180 pasting strings: give 10 strings, and find an arrangement to make a certain right and the largest, all-in-one search.
The longest path of an undirected graph in 1024 Magic Island. (Deep Priority Search)
1048 inverso breadth-first search, binary represents the state of heavy judgment.
1050 numbers & letters deep Priority Search
1135 the shortest time for crossing a map over the wilderness is preferred.
1107 simple puzzle: search by question. There may be zero front and sorting by output.
1150 simple magic board breadth-first search, fully arranged Hash Function Design
1151 magic board is the same as above.
1152 simple feasibility Pruning for the Maze problem of horse traveling.
1153 Ma Youxi's problem is the same as above. nodes in the extended state are sorted by the target function value.
1378 billion digital issue heuristic search.

[Dynamic Planning/recurrence/combined counting]

1342 happy Jin Ming backpack DP
1264 atomic car race DP basic questions.
1146 medicine collection 01 backpack residual DP
1355 the longest ascending subsequence of the bus in two dimensions
1169 ACM (acronymmaker) calculates the number of methods that can be abbreviated according to the meaning of the question.
1163 tour Euclidean Traveling Salesman Problem (p314 by Wu wenhu)
1233 neckshortdecomposition: separate letters by question.
1222 select a consecutive segment of words that contain the most and have the shortest length in a given article.
1211 merchant's propaganda sought the number of methods to arrive at Step 1 between two points.
1197 hotel string matching with common characters, memory-based search.
1120 walk through the forest simple undirected graph, calculate the number of methods from node 1 to node 2 by question.
1091 maximum sum calculates the sum after dividing two parts.
1098 marching in the Corp gives partial order relationships and calculates the number of possible ranking methods.
1049 Mondriaan 2*1 and 1*1 bricks are paved with 2 * n aisle methods.
1121 tri tiling 2*1 is converted into 3 * n number of aisles.
1019 apple tree tree DP, edge DFS edge updates the optimal value.
1138 the same is true for the treasure hunt.
1225 e-eye tree + side graph for minimum side coverage, tree DP.
1327 pinary recursion calculates the K pinary number.
1404 HIE with the pie status compressed DP
1233 neckshortdecomposition: separate letters by question.
1221 the number of N number series in a digital game reduces the number of B [I] each time. Calculate the maximum number of M.
1103 the top-code string is divided into DP, which requires the State representation method when the lexicographically output scheme is used.
1139 circuit stability recursive processing parentheses calculate the circuit failure probability of the sequence.
In the 1108 online selection Q & A game, K answers on layer n scored M points and the maximum number of answers 0 was obtained.
1123 The Longest walk directed graph is used to find the longest path of the non-repeating vertex at any starting and ending points, and the State compresses the DP
1033 City Road calculates the number of shortest methods ranging from 0 to n + 1, m + 1, and there are some obstacles in the middle.
1176 two ends two people get the number from both ends, and the other party greedy to get the big, you try to make the difference between the two big.
1413 Whac-A-Mole: the number of rats that can be hit within a certain period of time.
1415 honeycomb walk the number of methods for returning to the departure location in n steps.

[Bipartite]

1137 when finding the longest continuous interval in the bed, the difference between the minimum number and the maximum number is not greater than K.
1411 pie binary

Greedy]

1198 substring the minimum Lexicographic Order of 8 strings. (Sort by AB <BA for comparison functions)
1140 the king's heritage cut is no greater than the maximum branches of N/2 nodes
1134 blocks are distributed in ascending order.
1172 queens, knights and pawns dyeing Simulation
1193 up the stairs move the suitcase up the stairs.

Mathematics]

1302 Magic Square odd-order Cube Structure
1125 Arnie versus the IRS statistics on the number of 0-9 times during the two days, excluding weekends.
1200 stick has an odd number of wooden sticks. Each type has an even number, and each type has an odd number. Exclusive or
1251 plinko marbles game computing Probability
1258 it polynomial Derivation
1224 fast Match Game combinations: classical and stable marriage in mathematics.
The continuous number of 1047 super snooker and can be divided into two parts.
1448 antimonotonicity the maximum number of vertices not only for the tone sequence (F [0]> F [1] <F [2]> F [3 ]...)
1344 generation of a series of certain rules
1433 optimal parking
1259 sum of consecutive prime numbers continuous prime number and
1240 faulty odometer: 4 fewer digits in decimal format
1242 suit distribution bored count
1239 smallest differencev: A digital number that consists of two numbers with the smallest difference
1231 the embarrassed cryptographer two prime product, enumeration factor
1174 square count: the number of squares. The principle of rejection is as follows.
1214 find the number of AN = N in the Regular Expression of the Signal Analysis Series. The binary representation is a return.
1218 commemorative stamps are the same as 1209
1209 sequence sum possibilities evaluate the number of methods in which M is decomposed into different continuous integers and
1206 stacking cylinders heap cylinders, solving the equation.
1203 The cubic end calculates the ending number of a cube at the end of 1, 3, 7, and 9 as the original number.
1199 GCD calculates the number of GCD smaller than N and greater than m with N.
1190 reduced ID number: Find the smallest number so that all numbers are given. MOD has different results.
1099 packing passengers linear modulus Equation
1119 factstone benchmark ask n! <= 2 ^ K max N. logarithm of both sides.
1412 tour guide: n objects are uniformly moving in all directions.
1305 who's winner game question, find the rule.

[Simulation/others]

1323 switch text string processing.
1122 prerequisites.
1046 plane spotting sorting.
1097 led modding sorting.
1093 air express enumeration.
1237 paint mix black and white dyes mix the specified gray dye.
1202 comparison of the Bank of kalii date
1187 laserbox Robot Motion Simulation and DFS traversal.
1177 take your vitamins make some basic statistics as required.
The relationship between the 1182 context-free Clock Time and the angle between the hour and hour.
1100 Tennis anyone ranking statistics.
1110 IOI photos simulation. Statistics
1128 dice: determines whether the dice is left-handed or right-hand, and simulates rotation. (this can be done in reverse order)
1129 obtain the last digit of ISBN according to the given ISBN rule.
1133 spam outputs the valid email address in the input string.
1401 children of the candy corn simulates the left-hand rule to take the maze.
1438 shopaholic sorting: returns the sum of three values.
1306 sorting algorithm basic sorting and output.
1205 a programming language defined in the brainf * ck simulated interpretation execution question.