C++

# Include # include # define min (a, B) a = f1) f [I] [j-f1] = min (f [I] [j-f1], f [I-1] [j] + t1 ); f [I] [j] = min (f [I] [j], f [I-1] [j] + t2); if (j + f 2 # include # define min (a, B) a = f1) f [I] [j-f1] = min (f [I] [j-f1], f [I-1] [j]

Charge-stationTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission (s): 610 Accepted Submission (s): 306   Problem DescriptionThere are n cities in M ^ 3's empire. M ^ 3 owns a palace and a car and the

A given n (18 ≤ n ≤ 10 ^ 12), an proportional Series k + k ^ 2 + ....... + k ^ r = n or = n-1, and obtain the smallest k * r. If the smallest is not unique, take the smaller r Analysis: There are two unknown numbers: r, k, obviously, r has only a

After so long, I finally made an offline line segment tree .... I personally think that if the inquiry will affect each other, I will use the so-called "offline... This question is considered to add numbers one by one from left to right. If a [I]-1

/* 64-bit operation !!! A 01 matrix is given. T queries. Each time you ask whether the specified small Matrix exists in the large matrix. (64-bit record status !!!) */# Include # include # include # include # include # include # include #

H * w plank, put some 1 * L items, please put the space each time to accommodate and the top seatTrain of Thought: Find the largest seat each time, and then subtract LLine Segment tree function: query: the seat where the maximum value of the range

Question .. Start to use the edge and edge to determine the similarity triangle. After the wa game, write again and use the edge and edge to determine that it has passed .. Sad to reject T pay attention to two points: Judgment focus, determine

Occasionally, I saw this problem at the hero meeting. I haven't compiled it for a long time. The following is the address: http://hero.pongo.cn /. As a result, I began to search on the Internet, most of which were implemented by using the added

Each lattice has balloons of different colors expressed by different numbers. Each time a row or column is selected to stamp the balloon. Each person has K chances. Find which balloons cannot be penetrated within k chances. Output the balloon

The last question of the Line Segment tree is now. The line segment tree can do a lot of work, and it has higher requirements for itself when combined with DP. What you have to do is still far away ~ This question has been debugged for a long time...

N sticks to be cut, each of which has a length and weight, because when the length and weight to be cut are greater than the length and weight of the previous one, you do not need to adjust the size of the wooden stick for Direct Cutting. Otherwise,

Began to build a map of the rub, refer to the question of Daniel playing version is refreshing, and later changed basically the same http://www.cnblogs.com/woaishizhan/archive/2013/04/08/3008719.html meaning: given n, m indicates the following map

1. cpp: ------------------------------------------ # include int test () _ attribute _ (constructor (101); int test () {printf ("\ n -- In lib --"); return 0;} test. cpp // No call 1. in cpp, but you want to execute the test () function # include

Question link: uva-10304 question to a sequence can be S = (e1, e2 ,..., and e1 /** =================================================== =================== * This is a solution for ACM/ICPC problem ** @ source: uva-10304 Optimal Binary Search Tree *

Question: A string represents a four-character arithmetic expression, and the correct value of this expression must be calculated. Note: 1. The four arithmetic operations are addition, subtraction, multiplication, division, and "+-*/" 2. the number

Sometimes we need to embed a video player into the webpage to play the video on our server. Below I will post the code: embed the Video Player: file list: file 1 33 days out of love PIGA pig  Corresponding js control code

Test cases: // Doubtingtest. cpp: defines the entry point of the console application. // # Include "stdafx. h "# include // malloc header file # include "cstring" // memset header file using namespace std; void Func (char ** p) {* p = (char *)

This was the first time I thought it was too violent .. Don't dare .. After reading the question today, there are three methods: sol 1 is violent with STL .. Simple and rough, but considering your own time complexity analysis and insufficient

Exponential primary function G (x) = (1 + x/1! + (X ^ 2)/(2 !) +... + (X ^ n1)/(n1 !) ) * (1 + x/1! + (X ^ 2)/(2 !) +... + (X ^ n2)/(n2 !) * ...... * (1 + x/1! + (X ^ 2)/(2 !) +... + (X ^ nk)/(nk !) ) Convert the coefficient of x ^ m to temp/(m! );

Train of Thought: Split the ox and match them one by one, and then build a directed graph: T (1-N) T (1-N) T (1-N) T (1-d) T (1-N, the question of converting the size of each edge to 1 to the maximum flow: Why split the corresponding ox into two