Programmer Think

E - Charles in Charge Topic meaning: a person riding on the road with a battery car can be charged at every point. You can run as many miles as there is electricity. Now you are required to run the distance. The smaller the battery capacity of the electric vehicle, the better. What is the minimum capacity of the electric vehicle. Idea: firs ...

Usually, we start from the root node, do depth first search to the child nodes, and combine the optimal solutions of the child nodes to obtain the optimal solution of the node. For some problems, we need to start from the root node again and do a depth first search to the child nodes. For each node in the tree (except the root node), the inform ...

#include <iostream> #include <cstring> #include <algorithm> using namespace std; const int N = 20000,M=2000000; int h[N], e[M], ne[M], idx; void add(int a, int b) // Add an edge a - > b { e[idx] = b, ne[idx] = h[a], h[a] = idx ++ ; } int match[N],st[N]; bool find(int x) { for (int i = h[x]; i != -1; i = ne[i]) ...

Portal Meaning: Give you a length of n n String of n, + + +Represent 1 1 1， ...

E - Rook Path Meaning: Given size is H × W H×W H × W matrix, you now have a car (you can walk any distance in one direction in the matrix), and now the starting point is ( ...

Original title website For some reason, this website will not be accessible 1045. Medicine Collection - original website Title Description Chenchen is a gifted and intelligent child. His dream is to become the greatest doctor in the world. To this end, he wanted to learn from the most prestigious doctors nearby. The doctor gave him ...

   Welcome back to: meet blue bridge, meet you, not negative code, not negative Qing!    catalogue 1, What is dynamic programming DP 2, Memory search Typical example 1 Fibonacci sequence Method 1: violence recursion Method 2: memory search Deformation problem Typical example 2: climbing stairs (frogs jumping steps) Meth ...

Binary search tree Problem solution First of all, we find that for any subtree, the weight with you contained in it must be continuous to all our points added to the tree. Therefore, if we connect two subtrees to one root in reverse, the value range of the connected root must also be continuous. We can consider the interval dp. For points wit ...

121. The best time to buy and sell stocks [logic] Given an array of prices, its ith element prices[i] represents the price of a given stock on day I. You can only choose to buy this stock one day and sell it on a different day in the future. Design an algorithm to calculate the maximum profit you can make. Return the maximum profit you c ...

describe There are n children playing the game of losing sandbags. The rule is that after receiving the sandbags, each child will immediately throw them to another child. At the beginning, the sand bag was in the hands of the first child. After being thrown out m times, it returned to the hands of the first child. It can be assumed that the sa ...