2022 CCPC Henan Province Competition (A,E,F,G,H)
better reading experience
\color{red}{Better reading experience}
better reading experience
A. Mocha is in small classes
Original title link
Topic meaning:
a number that differs from each other
...
Posted by chamade76 on Fri, 07 Oct 2022 21:51:05 +0300
HDU7191 Count Set Problem Solving Report
HDU7191 Count Set Problem Solving Report
topic link
Topic
n
n
n numbers form a permutation
p
i
(
1
≤
...
Posted by Nirvana on Sat, 24 Sep 2022 21:24:21 +0300
dp14-17 longest ascending subsequence - original title + variant
dp 14 longest ascending subsequence (1)
Topic description
describe
Given an array arr of length n, find the length of its longest strictly ascending subsequence.
The so-called subsequence refers to a new array formed by deleting some numbers (or not deleting) from an array. For example [1,5,3,7,3] array, its subsequences are: [1,3,3], [ ...
Posted by cheese on Fri, 23 Sep 2022 21:58:32 +0300
2022 Hangzhou Electric Power Multi-School 9 (Summary + Supplement)
summary
Today, this multi-school should be the best one to hit this summer vacation (although the ranking is not very high). My starting teammate found that the tree dp was signed in for question 1009. I thought about guessing an even-numbered side. I stared at my teammate and wrote A for ten minutes. Then we went to see 1003 again. After my t ...
Posted by thomasgrant on Thu, 18 Aug 2022 22:30:52 +0300
[network flow] maximum flow: algorithm template, bipartite graph matching
Algorithm template
Time complexity of Ek algorithm: O(nm2)O(nm^2)O(nm2)
Give a flow network and maintain the residual network.
while(){
①Find Zengguang road in the current residual network(bfs):f'
②Update residual network:Put the current residual network Gf Residual network updated to new stream G(f+f')
}
① Simple traversal, bfsbfsbfs can b ...
Posted by caraldur on Wed, 25 May 2022 10:15:55 +0300
[immortal title] [LCA] Luogu P1852 jump checkers
Link
That's a good question,
subject
solution
From "only one chess piece can be skipped at a time", an important property of this question is obtained:
There are at most three jumping methods for these three chess pieces at a certain time: the middle piece jumps left and right, or the piece closer to the middle piece jumps to the m ...
Posted by phpScott on Tue, 24 May 2022 02:25:07 +0300
[SPFA] [bisection] set up telephone line
LinkLinkLink
luogu P1948luogu\ P1948luogu P1948
DescriptionDescriptionDescription
Farmer John plans to lead the telephone line to his farm, but the telecom company does not intend to provide him with free services. Therefore, FJ must pay a certain fee to the telecom company.
Around the farm of FJ, there are n (1 < = n < = 1000) abandoned ...
Posted by duclet on Mon, 23 May 2022 10:52:56 +0300
Introduction to graph theory, some basic concepts of graph theory and practical combat
Basic concepts
A graph is a set of N vertices and M edges. Graphs are divided into directed graphs and undirected graphs. If a direction is specified for each edge of a graph, the resulting graph is called a directed graph, and other edges are also called directed edges. In a directed graph, the edge associated with a point can be divided in ...
Posted by shure2 on Sun, 22 May 2022 21:16:43 +0300
Analysis of typical examples of acm network flow and cost flow
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
[problem solution] P1073 [NOIP2009 improvement group] optimal trade (graph theory, shortest path, SPFA)
[problem solution] P1073 [NOIP2009 improvement group] optimal trade
This question is wonderful!
Although this is only a green question, it still stuck me for a long time. The main reason is that there are two ideas in this question, which I totally didn't think of. I'm too hungry
Write down ideas to record this wonderful topic.
Title Link
[NOI ...
Posted by ALEXKENT18 on Sun, 22 May 2022 03:27:34 +0300