java-Dynamic Programming Algorithms Learning Notes
Original: java-Dynamic Programming Algorithms Learning Notes-huster-stl-Blog Park (cnblogs.com)
Dynamic programming is a branch of operational research and a mathematical method to solve the optimization of decision process. Dynamic planning often appears as a test question in written inter ...

Posted by Ruchi on Sun, 22 May 2022 20:51:09 +0300

introduction
The general difficulty of the problems of network flow and cost flow type lies in drawing. This paper mainly summarizes the various difficulties encountered by the author in the process of doing exercises and explains them in the form of examples.
On the relevant principles of network flow and cost flow, many blogs written in gre ...

Posted by newzub on Sun, 22 May 2022 16:31:05 +0300

I. Introduction
I recently worked as an intern in a company and spent three weeks working on an indoor positioning algorithm (rudimentary, not yet optimized) to realize the joint writing and debugging of matlab and C. The author believes that the difficulty lies in the various operations of the matrix. In C++ There is Eigen library available. E ...

Posted by manchuwok on Sun, 22 May 2022 14:49:52 +0300

Necessary and sufficient conditions for monotonicity of decision making
For two decision points, if at I, the large decision point is better than the small decision point, then at [i+1,n], the large decision point is better than the small decision point
When proving, there is no need for mathematical proof, and it is enough to prove that the ...

Bubble sorting
1. What is Bubble sorting？
Bubble Sort is the most basic exchange sort. The reason why it is called bubble sorting is that each element can be sorted bit by bit according to its own size like a small bubble array Move to one side of the.
Principle of bubble sorting:
Only one number can be determined to be returned in each tr ...

Improvement of binary tree traversal algorithm
The depth first traversal algorithms of binary tree are implemented by recursive functions, which is very inefficient. The reason is that the system calls a stack and does complex operations such as protecting the site and restoring the site, so that the traversal can be realized by very simple cod ...

Posted by Verrou on Sun, 22 May 2022 02:06:38 +0300

Let's talk about it. It's really shallow. It's completely based on the following inscription ↓
Luogu P3391
Look at the questions myself. I'm too lazy to stick...
analysis
In fact, there is nothing to analyze. This is a template problem of Splay tree, which solves the interval maintenance problem that can not be solved by general Treap. ...

Posted by springo on Sun, 22 May 2022 00:51:18 +0300

In practical daily life, people often encounter the following problems: in a given domainInside, find the functionCorresponding optimal value. Here, the minimum value problem is taken as an example (the maximum value problem can be equivalent to the minimum value problem), which is formalized as:
IfIf it is a discrete finite value, the optim ...

Posted by mdaoust on Sat, 21 May 2022 21:37:49 +0300

How to tell if a point is inside a polygon?
(1) Area sum discrimination method: determine whether the area sum of the triangle formed by the target point and each side of the polygon is equal to the polygon, and if it is equal, it is inside the polygon.
(2) Angle sum discrimination method: judge whether the sum of the angle between the target p ...

Posted by franko75 on Sat, 21 May 2022 21:28:54 +0300

Common interview questions of single linked list
Find the number of effective nodes in the single linked list
Find the penultimate node in the single lin k ed list (Sina)
Reversal of single linked list (Tencent)
Print the single linked list from end to end (Baidu requires mode 1: reverse traversal. Mode 2: stack stack)
Example 1: find the ...