u012870383的专栏

Problem AMake PalindromeInput: standard inputOutput: standard outputTime Limit: 8 seconds By definition palindrome is a string which is not changed when reversed. "MADAM" is a nice example

Anniversary partyTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5303    Accepted Submission(s): 2447Problem DescriptionThere is

E. Fishtime limit per test3 secondsmemory limit per test128 megabytesinputstandard inputoutputstandard outputn fish, numbered from 1 to n, live in a lake. Every day rig

炮兵阵地Time Limit: 2000MS Memory Limit: 65536KTotal Submissions: 18402 Accepted: 7099Description司令部的将军们打算在N*M的网格地图上部署他们的炮兵部队。一个N*M的地图由N行M列组成，地图的每一格可能是山地（用"H" 表示），也可能

Homer SimpsonTime Limit: 3000MS Memory Limit: Unknown 64bit IO Format: %lld & %lluDescriptionReturn of the AztecsProblem C:Homer SimpsonTime L

Problem EOptimal Binary Search TreeInput: standard inputOutput: standard outputTime Limit: 30 secondsMemory Limit: 32 MBGiven a set S = (e1, e2, ..., en) of n distinct elements such that e

Collecting BugsTime Limit:10000MS     Memory Limit:64000KB     64bit IO Format:%I64d & %I64uDescriptionIvan is fond of collecting. Unlike other people who collect post stamps, coins

4thIIUCInter-University Programming Contest, 2005GForming Quiz TeamsInput: standard inputOutput: standard outputProblemsetter: Sohel HafizYou ha

Strategic GameTime Limit: 20000/10000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5148    Accepted Submission(s): 2368Problem DescriptionBob enjoy

Balancing ActTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 9199 Accepted: 3826DescriptionConsider a tree T with N (1 <= N <= 20,000) nodes numbered 1.

#include #include#include#includeusing namespace std;char input[2000];char name[2000];char mention[2000];int dp[600000];int fa[600000];int path[600000];mapMax;mapkey;int main

Stock WaveTime Limit: 3 Sec  Memory Limit: 128 MBSubmit: 45  Solved: 9[Submit][Status][Web Board]DescriptionAs a stock analyst, Tom can forecast the trend according to a series of hi

Distinct SubsequencesTime Limit: 3000MSMemory Limit: Unknown64bit IO Format: %lld & %lluDescriptionProblem EDistinct SubsequencesInput: standard inputOutput: stan

Problem C: Edit Step LaddersAn edit step is a transformation from one word x to another word y such that x and y are words in the dictionary, and x can be transformed to y by adding, del

Always on the runTime Limit: 3000MS Memory Limit: Unknown 64bit IO Format: %lld & %lluDescription  Always on the run Screeching tires.

Problem DWavio Sequence Input: Standard InputOutput: Standard OutputTime Limit: 2 Seconds Wavio is a sequence of integers. It has some interesting properties.·  Wavio is of odd length i.

e-CoinsTime Limit: 3000MSMemory Limit: Unknown64bit IO Format: %lld & %lluDescriptionProblem Ge-CoinsInput: standard inputOutput: standard outputTime Limit: 10

Problem HString to PalindromeInput: Standard InputOutput: Standard OutputTime Limit: 1 Second In this problem you are asked to convert a string into a palindrome with minimum number of ope

Paths through the HourglassInput: Standard InputOutput: Standard OutputTime Limit: 2 SecondsIn the hourglass to the right a path is marked. A path always starts at the first row and ends at

Pay the PriceInput: standard inputOutput: standard outputTime Limit: 2 secondsMemory Limit: 32 MB In ancient days there was a country whose people had very interesting habits. Some of them

Pebble SolitaireTime Limit: 3000MS Memory Limit: Unknown 64bit IO Format: %lld & %lluDescriptionProblem APebble SolitaireInput: standard inputOutput: standard o

Party at Hali-BulaTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1890    Accepted Submission(s): 657Problem DescriptionDear Con

Problem GTriangle CountingInput: Standard InputOutput: Standard Output You are given n rods of length 1, 2…, n. You have to pick any 3 of them & build a triangle. How many distinct triangl

Problem DBuying Coke Input: Standard InputOutput: Standard OutputTime Limit: 2 SecondsI often buy Coca-Cola from the vending machine at work. Usually I buy several cokes at once, since my wo

A Simple Problem with IntegersTime Limit: 5000MS Memory Limit: 131072KTotal Submissions: 66557 Accepted: 20467Case Time Limit: 2000MSDescriptionYou have N i

从后往前dp，必须优化维度

uva 607 Scheduling Lectures解决方案：dp思路：dp[i]代表上了前面i个topic用的课时最少数，D[i]代表上了前面i个topic的最低不满意度；                  dp状态转移：dp[i]=min(dp[i],dp[j-1]+1)，j>=1&&jcode:#include #include#includeusing namespac

uva 10118 Free Candies解决方案：dp思路为：dp[a1][a2][a3][a4]表示当取四堆的a1、a2、a3、a4之后最多获得多少对糖，由于只有20种糖，可以开一个20大的数组表示当前篮子中的存在不存在这种糖（只存不同的糖，相同的收回口袋），用cnt来记录篮子中的糖的个数，若cnt==5，且没有相同的糖，则dp[a1][a2][a3][a4]=0，表示当前状态无法再取，

uva 10604 Chemical Reaction解决方案：dp思路：记忆化搜索，这题只有六种化学药品，可以开一个六维的数组进行dp，dp[a1][a2][a3][a4][a5][a6]，a1...a6分别表示这六种药品剩余多少，然后选两种药品进化学反应（可以使同样类型的药品），进入下一状态进行搜索，每个状态由下一状态决定其最优值。code：#include #include#in

uva 11008 Antimatter Ray Clearcutting dp思路：由于只有16棵树，所以可先预处理出可以一刀切的树的集合，stay_aline[i][j]沿着ij数切，所切的树的集合，可用一个32位大的数来表示，最低位是第0棵树，0表示不再这个集合中，1表示在，然后在用上三点共线的公式就可以处理出来了。记忆化搜索也是应用上了状态压缩，每次选两棵不同的数来切，除掉能切掉的数，

E. Porcelaintime limit per test3 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputDuring her tantrums the princess usually smash

D. Bag of micetime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputThe dragon and the princess are arguing abou

LOOPSTime Limit: 15000/5000 MS (Java/Others)    Memory Limit: 125536/65536 K (Java/Others)Total Submission(s): 2662    Accepted Submission(s): 1100Problem DescriptionAkemi Homura is a Maho

ContestTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 0    Accepted Submission(s): 0Problem Description In the ACM Internatio

Corn FieldsTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 7056 Accepted: 3754DescriptionFarmer John has purchased a lush new rectangular pasture compos

CDTime Limit: 3000MS Memory Limit: Unknown 64bit IO Format: %lld & %lluDescription  CD You have a long drive by car ahead. You have a tape

Dividing coinsTime Limit: 3000MS Memory Limit: Unknown 64bit IO Format: %lld & %lluDescription  Dividing coins It's commonly known tha

Big Event in HDUTime Limit: 10000/5000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 23526    Accepted Submission(s): 8297Problem DescriptionNowaday

Problem CChopsticksInput: Standard InputOutput: Standard OutputIn China, people use a pair of chopsticks to get food on the table, but Mr. L is a bit different. He uses a set of three ch

Problem IAgain PalindromesInput: Standard InputOutput: Standard OutputTime Limit: 2 Seconds A palindorme is a sequence of one or more characters that reads the same from the left as it doe