Tree DP problem solving record
It's been 15 days since the tree shaped dp was written (suddenly I think of the pigeon. Jihuan tree didn't learn) Tree DP DP on the tree Template It doesn't exist Basic exercises Boss dance https://www.luogu.com.cn/problem/P1352 If the boss goes, the subordinates don't. If the boss doesn't go, UTF-8...
Posted by rtown on Sun, 16 May 2021 09:55:34 +0930
Review and summary of knapsack problem
About initialization // dp[V]: the maximum value of Backpack Capacity V dp[i] = 0 => The largest Backpack Capacity V dp[i] = -inf => The backpack needs to be full 01 Backpack dp[i][j] = max(dp[i-1][j], dp[i][j-v[i]] + w[i]); Examples #include using namespace std; int main() { inUTF-8...
Posted by bobinindia on Fri, 11 Jun 2021 06:54:47 +0930
The maximum sum of JZ30 continuous subarrays
Title statement Given an array of positive and negative numbers, solve the maximum sum of elements in a continuous segment Algorithm 1: Violence Algorithm thinking Enumerate the left and right endpoints, then calculate the sum of this interval now, compare with ans, if it is larger than ans, uUTF-8...
Posted by NoFear on Sat, 19 Jun 2021 03:40:03 +0930
Secondary Scan and Root Change of DP in Trees
We need to lead to this topic by a topic Logu P3478Topic: Give a tree with n n Tree of n nodes, give us n − 1 n-1 n_1 edge, given edge weight, now asks who is the root node to make the maximum sum of the depths of other nodes. Depth means the number of edges of the simple path from that node toUTF-8...
Posted by Shawazi on Tue, 06 Jul 2021 01:40:57 +0930
NC632 Niuniu pendulum stick
Title statement Original address: Click here A wavy sequence is defined as: each number in the middle of the sequence is greater than or less than its adjacent number. The size is defined as the lexicographic order size, and the k-th wavy sequence in the sequence of length n is calculated. AlgUTF-8...
Posted by TexasMd91 on Fri, 16 Jul 2021 09:09:39 +0930
LeetCode-337. House raiding III
Topic source 337. House raiding III Title details After robbing a street and a circle of houses last time, the thief found a new area that could be stolen. There is only one entrance to this area, which we call "root". In addition to the "root", each house has and only has a "father" house connUTF-8...
Posted by iamali on Fri, 31 Dec 2021 05:43:03 +1030
Subsequence sum maximum, interval shortest correlation problem (monotone queue, DP)
Leetcode53. Maximum subarray sum Title Description Given an integer array nums, find a continuous sub array with the largest sum (the sub array contains at least one element) and return its maximum sum. Sample Input: nums = [-2,1,-3,4,-1,2,1,-5,4] Output: 6 Explanation: continuous subarray [4,-UTF-8...
Posted by lewisstevens1 on Mon, 17 Jan 2022 21:52:28 +1030
CF1175G Yet Another Partiton Problem
CF1175G Yet Another Partiton Problem. Very enlightening and challenging topic, ultra-high difficulty slope optimization. It is suggested to study first DP optimization II Slope optimization part and Advanced usage of segment trees Li Chaoshu. 2D/1D dynamic programming first considers the divideUTF-8...
Posted by dopey on Wed, 02 Feb 2022 08:00:13 +1030
「codeforces - 1481F」AB Tree
link. Sort out the logic, mainly talking about my doubts and other details not mentioned in the solution. First of all, it is easy to see that an inevitable greedy strategy is to lay the layers as close to the root as possible into the same characters. There may be doubts about whether the striUTF-8...
Posted by unknown on Sat, 05 Feb 2022 00:23:50 +1030
LIS (longest ascending subsequence) (refinement)
It's a one-dimensional sequence, and then one-dimensional sequence can be represented by one-dimensional Strange thief Kidd's glider wing This is that Kidd can slide in two directions at any point, and then do the lis directly, and then do it again in the opposite direction to find out the lonUTF-8...
Posted by rougue on Wed, 09 Feb 2022 17:36:50 +1030