C++

I want to practice the use of stack. In this question, the longest number of villages connected to x can be divided into two parts, the longest continuous sequence from 1 to the right of the X-1, the longest continuous sequence from x to the left of

I believe everyone knows the concepts of big-end storage and small-end storage. We generally don't need to consider them at ordinary times. However, in some cases, these concepts are very important. For example, during Socket communication, our

The question requires the sum of the shortest distance from the origin to all vertices and the shortest distance from all vertices to the origin. When finding the shortest distance from all vertices to the origin, a technique is used to reverse the

PictureTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission (s): 12879 Accepted Submission (s): 6698   Problem DescriptionGive you the width and height of the rectangle, darw it. InputInput contains a

This question is exactly the same as HDU3874. HDU3874 solution report Of course, the data is enhanced. The only difference is that each value is 10 ^ 9, so we need to discretization and directly implement STL. Then the process below will be exactly

Just like a previous question, it is always a problem of interval dyeing. I still use my old method to implement interval discretization + binary interval endpoint + interval processing, and the time is quite short.        The problem is that the

  It is a mountain called the Hongshan village. It is said that the nickname of Hong Xiuquan's concubine was this!   The mountains are full of wild fruits (Delicious )! I haven't climbed up for a long time! # Include # Include # Deprecision MAX 10000

Question: Here are N groups of balloons. Each group has 2 balloons. Each group has a balloon. If N balloons do not meet each other, the maximum radius of the balloon is R. Idea: directly bind the radius to 2-sat to determine the feasibility. If

Simple dp Sort weights by quality Only items that may be adjacent to their quality can obtain the Least Square of the Quality Difference Dp [I] [j] indicates the minimum fatigue required by j pairs in the first I items Dp equation: dp [I] [j] = min (

/* Bfs + the key to finding the tree diameter: if k # include # include # include # include # include # include # include using namespace std; typedef long ll; // typedef _ int64 int64; const int maxn = 100005; const int inf = 0x7fffffff;

Enter the plus or minus formula for positive integers less than 100 on the keyboard. Write a program to output the computation result string.The format of the input string is "operand 1 operator operand 2", and "operand" and "operator" are separated

The SuspectsTime Limit: 1000 MS Memory Limit: 20000 KTotal Submissions: 18782 Accepted: 9084 Description Severe acute respiratory syndrome (SARS), an atypical ppneumonia onia of unknown aetiology, was recognized as a global threat in mid-March 2003.

Analyze the problem and consider the known data structure. Details are very important. # Include # include # include # include # include using namespace std; // If an array is marked, it is incorrect. For example, for example, 3 1 2 5 4, after

Question: Divide n friends into m groups. Find the minimum number of people in each group ,,, The maximum stream + two points, and isap run quite fast ,,,         # Include # include const int n= 1510; const int inf = 0x3fffffff; int dis [N], gap [

Special equationsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission (s): 206 Accepted Submission (s): 108Special Judge Problem DescriptionLet f (x) = anxn +... + a1x + a0, in which ai (0   InputThe first

As a teacher of a kindergarten, you have has things to do during a day, one of which is to allot candies to all children in your class. today you have N candies for the coming M children. each child likes different candy, and as a teacher who know

// File Name: wiki1282.cpp // Author: bo_jwolf // Created Time:, Saturday, August 17, 2013 # include # include # include # include # include # include # include # include # include # include # include # include # include # include #

The prime factor decomposition of numbers ..   Code:    #include #include #include #include using namespace std; typedef long long LL; int main() { LL n, p, t, i; int pri[100], e[100]; while (true) { cin >> p; n =

Question: There is a spanning tree with the length of each side being 1 The terrorists blow up one of the sides and divide them into two parts. Get the larger diameter in the diameter of the temp two-digit multiplied by the weight of this edge. Find

Meaning: There are n regions, and each region has some gold mines. Mining a gold mine requires a certain amount of money and may produce a certain amount of profit. If you want to open a gold mine, all the gold mines above this gold mine must be