Azarath Metrion Zinthos

Problem I: Ingenuous CubrencyPeople in Cubeland use cubic coins. Not only the unit of currency is called acube but also the coins are shaped like cubes and their values are cubes. Coins with value

Divide ChocolateTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1271    Accepted Submission(s): 604Problem DescriptionIt is well

HeroTime Limit: 6000/3000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1869    Accepted Submission(s): 868Problem DescriptionWhen playing DotA with

Save the dwarfsTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 934    Accepted Submission(s): 285Problem DescriptionSeveral dwar

Problem EGame of SumInput File: e.inOutput: Standard Output This is a two player game. Initially there are n integer numbers in an array and players A and B get chance to take them alternati

Problem HHackers’ Crackdown Input: Standard InputOutput: Standard Output Miracle Corporations has a number of system services running in a distributed computer system which is a prime targ

Magic NumberTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1113    Accepted Submission(s): 480Problem DescriptionThere are many

Input: Standard InOutput: Standard OutNext Generation Contest 1 Time Limit: 2 secondsProblem DPlacing LamppostsAs a part of the mission �Beautificat

Problem FFEWEST FLOPSA common way to uniquely encode a string is by replacing its consecutive repeating characters (or “chunks”) by the number of times the character occurs followed by the

A cellular network is a radio network made up of a number of cells each served by a base station located in the cell. The base station receives call signals from mobile users (mobiles) in the cell i

Hourai JeweledTime Limit: 4000/2000 MS (Java/Others)    Memory Limit: 163840/163840 K (Java/Others)Total Submission(s): 810    Accepted Submission(s): 291Problem DescriptionKaguya Hour

Problem FCyborg GenesTime Limit1 SecondSeptember 11, 2132.This is the day that marks the beginning of the end – the end of you the miserable humans. For years you h

Problem F: Weights and MeasuresI know, up on top you are seeing great sights, But down at the bottom, we, too, should have rights. We turtles can't stand it. Our shells will all crack! Besides

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

4th IIUC Inter-University Programming Contest, 2005GForming Quiz TeamsInput: standard inputOutput: standard outputProblemsetter: Sohel HafizYou have

Dart gameTime Limit 1000msMemory Limit 65536Kdescription　　　Darts originated in Australia. Australia's aborigines initially for hunting and hit

Post officeTime Limit 1000msMemory Limit 65536KdescriptionThere are N(N input　　For each test case, the first line i

魔法串Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 474    Accepted Submission(s): 200Problem Description　　小明和他的好朋友小西在玩一个新的游戏，由小西

Happy Programming ContestTime Limit: 2 Seconds      Memory Limit: 65536 KBIn Zhejiang University Programming Contest, a team is called "couple team" if it consists of only two students lovin

DescriptionVasya plays the LionAge II. He was bored of playing with a stupid computer, so he installed this popular MMORPG, to fight with his friends. Vasya came up with the name of his character

4th IIUC Inter-University Programming Contest, 2005IWalking on a GridInput: standard inputOutput: standard outputProblemsetter: Sohel HafizYou will

Bob enjoys playing computer games, especially strategic games, but sometimes he cannot find the solution fast enough and then he is very sad. Now he has the following problem. He must defend a medieva

动态规划基础例题LA 3882UVa 3882 - And Then There Was One 递推------------无力orzUVa 1063510635 - Prince and Princess LCS&LISUVa 10891Uva 10891 - Game of Sum dp博弈UVa 11825Uva 11825 - Ha

7758. Growing StringsProblem code: MGLAR10  EnglishVietnamese   Gene and Gina have a particular kind of farm. Instead of growing a

Two Rabbits---------------------------------------------------------------------模型可以转化为求长度为n的序列的最长回文子序列方法为枚举起点+记忆化+环形dp用next(i)代替i++,prev(i)代替i--f[i][j]表示环(i,j)的最长回文子序列。若i=j则环区间为空,若i>j

一、单调队列二、单调队列dp三、斜率优化四、BST解决不单调的dp问题

回文子序列----------------------------环形回文子序列HDU 4745 Two Rabbits----------------------------重点是用next() prev() 代替l+1,r-1----------------------------const int maxn=1111;int a[maxn];

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

--------int n;int a1[111111];int a2[111111];int c[111111];int a[111111];int g[111111];int d[111111];int N,p,q;int main(){ int T; scanf("%d",&T); for (int cas=1;cas<=T;cas++)

-----------const int maxn=10000;const int maxm=110000;int n;struct EdgeNode{ int to,next;}edges[maxm];int head[maxn],edge;void init(){ memset(head,-1,sizeof(head)); edge=0;}void

--------------------const int maxn=100000;const int maxm=10000;const LL LIM=1234567890LL;LL n,k;LL f[maxn];LL sum[maxn];int main(){ while (cin>>n>>k){ if (n==0) break; if (

经典题目

Good NumbersTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 602    Accepted Submission(s): 220Problem DescriptionIf we sum up ev

Minimizing maximizerTime Limit: 5000MS Memory Limit: 30000KTotal Submissions: 3047 Accepted: 1187DescriptionThe company Chris Ltd. is preparing a new sorting ha

The NASA Space Center, Houston, is less than 200 miles from San Antonio, Texas (the site of the ACM Finals this year). This is the place where the astronauts are trained for Mission Seven Dwarfs, the

Bob is a strategy game programming specialist. In his new city building game the gaming environment is as follows: a city is built up by areas, in which there are streets, trees, factories and buildin

Garbage HeapTime limit: ? secondsMemory limit: 64 megabytesFarmer John has a heap of garbage formed in a rectangular parallelepiped.It consists of  garbage pieces each of which has a value.

Cut the cakeTime Limit: 6000/3000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 835    Accepted Submission(s): 308Problem DescriptionMark bought a h

问题描述：给定一个N*M的矩阵，其中有一些格子是空地，其他是障碍。找出一个全部由空地组成的面积/周长最大的子矩阵。朴素算法：枚举左上角的坐标O(mn)和右下角的坐标O(mn)，判断是否全为空地O(mn)，时间复杂度为O(m3*n3)。扫描线法：把点(i，j)向上所有连续的空格看做一条悬线。矩阵中的每个点都向上对应了一条悬线。①用h[i,j]表示点

Dragon BallTime Limit: 3000/1500 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1680    Accepted Submission(s): 614Problem DescriptionSean has got a