Programmer Group

P1003 [NOIP2011 improvement group] carpet laying Title Description In order to prepare for a unique award ceremony, the organizers laid some rectangular carpets on a rectangular area of the venue (which can be regarded as the first quadrant of the plane rectangular coordinate system). There are nn carpets, numbered from 11 to nn. Now lay thes ...

Portal 1 perhaps Portal 2 Note that the space limit is 8MB! This question is too comprehensive. If you can write it independently, it means that you can get gold at Macao station. In addition, the space complexity of tree chain subdivision optimization is really the first time I heard~ Firstly, it examines a conclusion of game theory: in the ...

This week, I continued to do questions and found many problems and deficiencies that need to be improved. P1064 [NOIP2006 improvement group] Jin Ming's budget plan This is a knapsack problem, but some changes have been added on the basis of the original complete knapsack: each item has at most 2 accessories. Only by adding this item can its acc ...

catalogue188. The best time to buy and sell stocks IVsubjectProblem solution 188. The best time to buy and sell stocks IV subject Given an array of integers   prices, its i-th element   prices[i] is the price of a given stock on day I. Design an algorithm to calculate the maximum profit you can make. You can complete up to k transacti ...

Doorman Topic overview Problem solution Sister's favorite tree set tree optimization dp. First, it should be easy to come up with a d p dp The idea of dp. As Niuniu has only two movements in the whole process, stay at the door, run ...

Destruction plan Title Link: ybtoj high efficiency advanced 21169 General idea of the topic Give you a tree, and then you need to find two paths without intersecting edges, so that after deleting the points of the two paths and their adjacent edges, the tree is divided into as many connected blocks as possible. thinking This is the classif ...

        This week, I mainly brush some dp questions. Finally, if I want to brush according to the topic, I'll start with the backpack. Today, I don't see the question for the first time. I solved a backpack question in the provincial competition last year. I'm still very excited. At least I didn't learn in vain. It's still ...

1. Introduction 1.1 what is dynamic programming? Dynamic Programming is a mathematical method of optimization in the solution process (also known as global optimization). The multi-step process is transformed into a series of single-step problems, which are solved one by one by using the relationship between each step. (dynamic programmi ...

subject https://leetcode.com/problems/shopping-offers/ Problem solution Similar topics include: leetcode 474. Ones and Zeroes | 474. One and zero (double constrained knapsack problem) This problem is essentially a knapsack problem with multiple constraints (n < 6). The goal is to minimize the total price when the knapsack is just full. ...

Hello, guys. Today, I'd like to briefly talk about the TSP problem of this repeatable city. The so-called repeatable means that the city and route can be taken casually, as long as the sum of its paths is the smallest in the end. The knowledge points to be used are state compression dp and Floyd algorithm 1, Floyd algorithm Floyd algorithm: ...