Others

Main Problems to be Solved Select K numbers that are not adjacent to n to minimize the total number of K numbers. View code # Include # Include # Include Using Namespace STD; Int DP [ 2010 ] [ 1010 ]; Int A [ 2012 ]; Const Int

Tiles of Tetris, not! Time Limit: 2000/1000 MS (Java/others) memory limit: 32768/32768 K (Java/Others)Total submission (s): 569 accepted submission (s): 229 Problem descriptionyou 've really messed up this time. "Go buy some square tiles" your

Question link: http://acm.zju.edu.cn/onlinejudge/showProblem.do? Problemid = 4255 The idea of DP is that if you want to access [I, j], its subintervals must have been accessed. Use DP [I] [J] [0] to indicate the access interval [I, j] and leave

Cut the sequence Time limit:2000 ms   Memory limit:131072 K Total submissions:7972   Accepted:2287 Description Given an integer SEQUENCE {An} Of LengthN, You are to cut the sequence into several

Safecracker Time Limit: 2000/1000 MS (Java/others) memory limit: 65536/32768 K (Java/Others)Total submission (s): 3713 accepted submission (s): 1919 Problem description = Op Tech briefing, 2002/11/02 CST = "The item is locked in a Klein safe behind

Half plane intersection template O (N ^ 2) in http://www.cnblogs.com/wuyiqi/archive/2012/03/30/2426175.html Question: Judge the sum of the shortest cut marks of the convex polygon required to be cut out on a square. There are only eight sides in

There is a war and it doesn't look very promising for your country. now it's time to act. you have a commando squad at your disposal and planning an ambush on an important enemy camp located nearby. you have N Soldiers in your squad. in your

Control Time Limit: 2000/1000 MS (Java/others) memory limit: 32768/32768 K (Java/Others)Total submission (s): 238 accepted submission (s): 135 Problem description you, the Head of Department of Security, recently received a top-secret information

Pyramids Time limit:1000 ms   Memory limit:65536 K Total submissions:2268   Accepted:751   Special Judge Description Recently in Farland, a country in Asia, a famous scientist mr. log

Quick Out Of The harbour Time Limit: 2000/1000 MS (Java/others) memory limit: 32768/32768 K (Java/Others)Total submission (s): 75 accepted submission (s): 47 Problem descriptioncaptain clearbeard decided to go to the harbor for a few days so his

Card games Time Limit: 3000/1000 MS (Java/others) memory limit: 65535/32768 K (Java/Others)Total submission (s): 376 accepted submission (s): 115 Problem description James was bored at home recently, so he invented an interesting game with N

Eddy's picture Time Limit: 2000/1000 MS (Java/others) memory limit: 65536/32768 K (Java/Others)Total submission (s): 2454 accepted submission (s): 1184 Problem descriptioneddy begins to like painting pictures recently, he is sure of himself to

A simple gametime limit: 1000/1000 ms (Java/other) memory limit: 32768/65535 K (Java/other) total submission (s): 2 accepted submission (s ): 2 problem descriptionagrael likes play a simple game with his friend animal during the classes. in this

An ultimate backpack question that combines all the backpacks. If you do this, the backpack will be okay. Question: give you a description of N types of items, backpack capacity d Each type has three attributes, k e p. K indicates the maximum

Strategic game Time Limit: 20000/10000 MS (Java/others) memory limit: 65536/32768 K (Java/Others)Total submission (s): 2916 accepted submission (s): 1217 Problem descriptionbob enjoys playing computer games, especially strategic games, but

ArticleDirectory String Conversion Poj1915 In fact, it is BFs. It is found when the initial status and target status are searched at the same time. However, implementation is quite troublesome. I imitatedProgramThe substring

Poj 2777 /* Color line segments and count the number of colors in the segments Because there are not many colors, bitwise operations can be used, but I still use arrays to record Note: C> and That is, (x SimplifiedCode. But there are

The number of attacks equals to the total number of attacks minus the number of successful defenses This question is mainly used to calculate the number of successful defenses. Add an auxiliary array pos [] to record the number of attacks at a

Template Library Management Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission (s): 298 Accepted Submission (s): 87Problem DescriptionAs an experienced ACMer, you must have known the importance of "code

Line belt Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission (s): 1820 Accepted Submission (s): 683Problem DescriptionIn a two-dimen=plane there are two line belts, there are two segments AB and CD,