2015年05月_martinue

原创 hdu2089（数位dp）

Problem Description杭州人称那些傻乎乎粘嗒嗒的人为62（音：laoer）。杭州交通管理局经常会扩充一些的士车牌照，新近出来一个好消息，以后上牌照，不再含有不吉利的数字了，这样一来，就可以消除个别的士司机和乘客的心理障碍，更安全地服务大众。不吉利的数字为所有含有4或62的号码。例如：62315 73418 88914都属于不吉利号码。但是，61152虽然含有

2015-05-30 23:55:04 388

原创 hdu2476(区间dp)

Problem DescriptionThere are two strings A and B with equal length. Both strings are made up of lower case letters. Now you have a powerful string painter. With the help of the painter, you can ch

2015-05-24 17:01:13 1379

原创 hdu 4283（区间dp）

Problem Description　　The TV shows such as You Are the One has been very popular. In order to meet the need of boys who are still single, TJUT hold the show itself. The show is hold in the Small ha

2015-05-22 16:51:06 691

原创 uva 202求循环小数

The decimal expansion of the fraction 1/33 is , wherethe is used to indicate that the cycle 03 repeatsindefinitely with no intervening digits. In fact, the decimal expansion ofevery rational numb

2015-05-19 21:21:20 560

In a serious attempt to downsize (reduce) the dole queue, The NewNational Green Labour Rhinoceros Party has decided on the followingstrategy. Every day all dole applicants will be placed in a largecir

2015-05-19 21:13:19 379

原创 hdu1081（最大子矩阵）

Problem DescriptionGiven a two-dimensional array of positive and negative integers, a sub-rectangle is any contiguous sub-array of size 1 x 1 or greater located within the whole array. The sum of

2015-05-14 00:49:32 399

原创 hdu 1203（完全背包）

Problem DescriptionSpeakless很早就想出国，现在他已经考完了所有需要的考试，准备了所有要准备的材料，于是，便需要去申请学校了。要申请国外的任何大学，你都要交纳一定的申请费用，这可是很惊人的。Speakless没有多少钱，总共只攒了n万美元。他将在m个学校中选择若干的（当然要在他的经济承受范围内）。每个学校都有不同的申请费用a（万美元），并且Speakless估计了

2015-05-11 23:29:06 1625

原创 hdu 1165（找规律）

Problem DescriptionAs is known, Ackermann function plays an important role in the sphere of theoretical computer science. However, in the other hand, the dramatic fast increasing pace of the funct

2015-05-10 22:33:59 556

原创 hdu 1208（记忆化搜索）

Problem DescriptionAn n x n game board is populated with integers, one nonnegative integer per square. The goal is to travel along any legitimate path from the upper left corner to the lower right

2015-05-10 21:21:34 529

原创 hdu 1159 最长公共子序列

Problem DescriptionA subsequence of a given sequence is the given sequence with some elements (possible none) left out. Given a sequence X = another sequence Z = is a subsequence of X if there e

2015-05-10 21:15:16 517 2

原创 NEFU 642 monkey（记忆化搜索）

description Cc is a lovely monkey. It likes to play the game "catching plates". The game is as follows. There are n pegs in a line numbered from 1 to n. Cc stands on the first peg at

2015-05-07 00:44:36 493

原创 hdu 1754 I Hate It（线段树）

Problem Description很多学校流行一种比较的习惯。老师们很喜欢询问，从某某到某某当中，分数最高的是多少。这让很多学生很反感。不管你喜不喜欢，现在需要你做的是，就是按照老师的要求，写一个程序，模拟老师的询问。当然，老师有时候需要更新某位同学的成绩。 Input本题目包含多组测试，请处理到文件结束。在每个测试的第一行，有两个正整数 N

2015-05-05 21:42:08 738

原创 nefu1037回文子序列数（区间dp）

description给定字符串，求它的回文子序列个数。回文子序列反转字符顺序后仍然与原序列相同。例如字符串aba中，回文子序列为"a", "a", "aa", "b", "aba"，共5个。内容相同位置不同的子序列算不同的子序列。input第一行一个整数T，表示数据组数。之后是T组数据，每组数据为一行字符串。

2015-05-04 20:53:35 554

原创 hdu 1069 （最长上升子序列）

Problem DescriptionA group of researchers are designing an experiment to test the IQ of a monkey. They will hang a banana at the roof of a building, and at the mean time, provide the monkey with s

2015-05-01 00:23:04 364

原创 hdu1078 （记忆化搜索）

Problem DescriptionFatMouse has stored some cheese in a city. The city can be considered as a square grid of dimension n: each grid location is labelled (p,q) where 0 <= p < n and 0 <= q < n. At e

2015-05-01 00:07:51 776

martinue