松子茶的专栏

HDU1059.Marsha and Bill own a collection of marbles. They want to split the collection among themselves so that both receive an equal share of the marbles. This would be easy if all the marbles had the same value, because then they could just split the col

ChessTime Limit: 6000/3000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 718    Accepted Submission(s): 283Problem

Corn FieldsTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 12435 Accepted: 6531DescriptionFarmer John has purchased a lush new rectangular pasture composed of M by N (1 ≤ M ≤ 12; 1 ≤ N ≤ 12)

Islands and BridgesTime Limit: 4000MS Memory Limit: 65536KTotal Submissions: 10344 Accepted: 2693DescriptionGiven a map of islands and bridges that connect these islands, a Hamilton path, as we all kn

IntervalsTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 7564 Accepted: 3172DescriptionYou are given N weighted open intervals. The ith interval covers (ai, bi) and weighs wi. Your task is t

RelocationTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 3116 Accepted: 1259DescriptionEmma and Eric are moving to their new house they bought after returning from their honeymoon. Fortunat

PhalanxTime Limit: 10000/5000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1093    Accepted Submission(s): 522Problem DescriptionToday is army day, but the service

TravellingTime Limit: 6000/3000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6388    Accepted Submission(s): 2069Problem DescriptionAfter coding so many days,

HDU4433 locker Limit: 6000/3000 MS    Memory Limit: 32768 K Total Submission(s): 1763    Accepted Submission(s): 800.dp[i][x][y]表示处理到第i个，后面两个数字是x,y，把前i位转正确需要的最少步数。计算dp[i][x][y]时，前i-2位是题目给的现在状态的值，第i-1位是x,第i位是y,就是把前i位转正确。要把dp[i]的状态转移到dp[i-1]去。把第i位从x转到目标态b[i]

守护雅典娜Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 609    Accepted Submission(s): 179许多塔防游戏都是以经典的“守护雅典娜”为原型的。玩家需要建立各种防御工具来阻止怪物接近我们的女神——雅典娜。这里，我们可以建造的防御工具只有标准圆形状的防御墙，建立在雅典娜与怪物出生点之间的防御墙数目越多，胜利的希望就越大。这

SubstringsTime Limit: 10000/5000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2918    Accepted Submission(s): 895Problem DescriptionXXX has an array of length n. X

炮兵阵地Time Limit: 2000MS Memory Limit: 65536KTotal Submissions: 24698 Accepted: 9531Description司令部的将军们打算在N*M的网格地图上部署他们的炮兵部队。现在，将军们规划如何部署炮兵部队，在防止误伤的前提下（保证任何两支炮兵部队之间不能互相攻击，即任何一支炮兵部队都不在其他支炮兵部队的攻击范围内），在整个地图区域内最多能够摆放多少我军的炮兵部队。

True LiarsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 2856 Accepted: 919DescriptionAfter having drifted about in a small boat for a couple of days, Akira Crusoe Maeda was finally cast as

Kaka's Matrix TravelsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 9244 Accepted: 3736DescriptionOn an N × N chessboard with a non-negative number in each grid, Kaka starts his matrix trav

Little shop of flowerstime limit per test: 0.25 sec. memory limit per test: 4096 KBPROBLEMYou want to arrange the window of your flower shop in a most pleasant way. You have F bunches of flowers,

HDU3045 Picnic Cows .关于程序算法艺术与实践更多讨论与交流，敬请关注本博客和新浪微博songzi_tea.

HDU3681 Prison Break（DP Limit: 5000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4476    Accepted Submission(s): 1211Problem DescriptionRompire is a robot kingdom an

HDU4055 Number StringLimit: 10000/5000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1736    Accepted Submission(s): 810

Brackets SequenceTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 29862 Accepted: 8543 Special JudgeDescriptionLet us define a regular brackets sequence in the following way: 关于程序算法艺术与实践更多讨论与交流，敬请关注本博客和新浪微博songzi_tea.

Wireless PasswordTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5817    Accepted Submission(s): 1857.关于程序算法艺术与实践更多讨论与交流，敬请关注本博客和新浪微博songzi_tea.

HDU1847 Good Luck in CET-4 Everybody!关于程序算法艺术与实践更多讨论与交流，敬请关注本博客和新浪微博songzi_tea.

HDU4540.Time Limit: 300/100 MS (Java/Others)    Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 2956    Accepted Submission(s): 1451Problem Description.关于程序算法艺术与实践更多讨论与交流，敬请关注本博客和新浪微博songzi_tea.

度度熊是一只喜欢探险的熊，一次偶然落进了一个m*n矩阵的迷宫，该迷宫只能从矩阵左上角第一个方格开始走，只有走到右上角的第一个格子才算走出迷宫，每一次只能走一格，且只能向上向下向右走以前没有走过的格子，每一个格子中都有一些金币（或正或负，有可能遇到强盗拦路抢劫，度度熊身上金币可以为负，需要给强盗写欠条），度度熊刚开始时身上金币数为0，问度度熊走出迷宫时候身上最多有多少金币。。。关于程序算法艺术与实践更多讨论与交流，敬请关注本博客和新浪微博songzi_tea.

HDU4833 Best FinancingTime Limit: 20000/10000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 565   关于程序算法艺术与实践更多讨论与交流，敬请关注本博客和新浪微博songzi_tea.

Time Limit:500ms Memory Limit:10000KDescriptionProblems involving the computation of exact values of very large magnitude and precision are common. For example, the computation of the national debt is

Time Limit: 2 Seconds Memory Limit: 65536 KBOn every June 1st, the Children's Day, there will be a game named "crashing balloon" on TV.   The rule is very simple.  On the ground there are 100 labeled

时间限制：1000 ms  |  内存限制：65535 KB  难度：4描述 Given a n × n matrix A and a positive integer k, find the sum S = A + A2 + A3 + … + Ak.输入The input contains exactly one test case. The first line of input contai

POJ3186 Treats for the Cows ..关于程序算法艺术与实践更多讨论与交流，敬请关注本博客和新浪微博songzi_tea.

HDU1078 FatMouse and Cheese.Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8113    Accepted Submission(s): 3394关于程序算法艺术与实践更多讨论与交流，敬请关注本博客和新浪微博songzi_tea.

HDU4545 魔法串.Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 2224    Accepted Submission(s): 821.关于程序算法艺术与实践更多讨论与交流，敬请关注本博客和新浪微博songzi_tea.

POJ2411 Mondriaan's Dream.关于程序算法艺术与实践更多讨论与交流，敬请关注本博客和新浪微博songzi_tea.

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 11302    Accepted Submission(s): 5447Problem.关于程序算法艺术与实践更多讨论与交流，敬请关注本博客和新浪微博songzi_tea.

HDU4301 Divide Chocolate(DP）.Divide ChocolateTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2081

HDU4283 You Are the One。 Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3123    Accepted Submission(s): 1408Problem Description

HDU3507 Print Article.关于程序算法艺术与实践更多讨论与交流，敬请关注本博客和新浪微博songzi_tea.