Others

This question is DP? However, it is clear that the solution is not DP... for this class of question about finding a combination of intervals... You can first set each sum (1 ~ K) calculate... get the value of a certain range by the difference

A tough question... although there are obvious difference constraints, I am so wrong. N long n long ah ~~ I still don't know why !!! Although it is obvious that it is a difference constraint question, and the information on the Internet is messy...

Haha... A teammate recommended this question to me. I didn't want to do question a because I was too big to read the English question. However, you only need to check the input and output to understand the general idea of this question. It's so

This question is a bit interesting, but it is relatively simple .. Directly PasteCode. Hehe .... /* ID: Guo Geer prog: spinlang: C ++ */# include using namespace STD; int main () {ifstream fin ("spin. in "); ofstream fout (" spin. out "); int

Question: (Abc) represents the infinite loop of abc .... question (a1a2a3 ....) + (b1b2b3 ...) the value is .. (...) ** format (the previous is cyclical ..) Question I think a little more about this exercise. The sum of the two violent questions is

Question: The truth is that splay and the dynamic tree have been abused and paralyzed. I have forgotten the Hungary algorithm ~~ Whether it is the maximum matching or the maximum matching minimum cost ~ What about Hungary ~ KM Can be flashed .. it's

I cannot understand the meaning of the question .... in general: It starts from a specified room... can I return to room 0... and close all the doors in the figure .. the door cannot be opened after being closed... The input is amazing. I read a row

Alipay pets Time Limit:1000 MS Description Vivo has adopted an unknown little pet !!... The life of a pet is five units of time and there will be no accidental braid in the middle (for example, from 0 to 5, but not 6 ).. the pet goes through two

Two questions are one question ~~ Only POJ is weaker. You only need to find the number of rooms and the maximum room area... First, construct a wall ~~ I use a four-digit bool array to record the wall situation of each vertex... % 2 at the time of

A Manually create a ing between tables... then convert octal to decimal .. Program: #include#include#include#include#include#include#include#include#define ll long long#define oo 1000000000#define pi acos(-1)using namespace std; ll

Question: Place a rectangle of 1*2 in a matrix... some points cannot be placed in a rectangle. How many rectangles can be placed at most .... Question: My first response to this question is status compression DP .. but check the range. okay ..

Is the question greedy? Okay .. it's really greedy .. I tried a solution a little bit .. it's over... this dislike is to sort all projects by D .. arrange work in this order .. the biggest penalty in the process is .. principle .. I just feel that

Question Opening a Party... it will rain in t minutes... tell everyone the coordinates and the running speed .. tell the coordinates of each umbrella .. ask how many people can successfully hide in the rain at most... Question: Edge construction

The pass rate is quite low .... the reason is that most teams are greedy... find out the point where A is the smallest and B is not 0 .. it can be used to connect all the blame that B is not 0... the middle interval can take away the blame that B is

The so-called nerd, or the nerd we generally understand, thinks so, that is, the dead reader. Part of the reason for this is that it is related to the previous book, but of course this article is absolutely not a reference, and it has no special

The better method for this question is monotonous queue. Implement it later. Use castrated line tree to write 9600 ms + + records ~ The simple line segment tree will not be mentioned. For details, you can read previous articles or the following code

Hehe ...... When doing this question, the first thought was what algorithm of graph theory should be used at that time. Later I thought left and right, I thought that I could not talk about one of the classical graph theory algorithms. Then I wrote

I read sanxian's retirement report in the morning and felt a lot about it. In the last year of ACM, I decided to learn his methods, read less about the report, and thought about it myself, maybe one day I can also invent something like YY tree.

A long time ago, I wanted to do K short circuit. It's just a tough little dish ~. First, let's talk about A * algorithm. As we all know, the * algorithm is A heuristic search in the basic form: f (x) = g (x) + h (x); Where f (x) represents the total

In the tragic internal competition, I am still too weak. = the second-to-last result ~~ Tragic code = 300 + Ah ~~~ #include #include #include #include #include #include #include using namespace std;struct node{ int date; int