dynamic programming
文章平均质量分 87
Geterns
这个作者很懒,什么都没留下…
展开
-
POJ1088:动规初探
滑雪Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 35601 Accepted: 12466DescriptionMichael喜欢滑雪百这并不奇怪, 因为滑雪的确很刺激。可是为了获得速度,滑的区域必须向下倾斜原创 2010-04-08 10:02:00 · 610 阅读 · 0 评论 -
USACO: Beef McNuggets
Beef McNuggetsHubert ChenFarmer Brown's cows are up in arms, having heard that McDonalds is considering the introduction of a new product: Beef McNuggets. The cows are trying to find any possible way to put such a product in a negative light. One strategy原创 2011-01-19 20:07:00 · 285 阅读 · 0 评论 -
USACO: Raucous Rockers
Raucous RockersYou just inherited the rights to N (1 Since you are a classical music fan and have no way to judge the artistic merits of these songs, you decide on the following crit原创 2011-01-15 02:37:00 · 410 阅读 · 0 评论 -
USACO: Home on the Range
Home on the RangeFarmer John grazes his cows on a large, square field N (2 Your task is to count up all the various square原创 2011-01-06 22:21:00 · 244 阅读 · 0 评论 -
USACO: Camelot
<br />Camelot<br />IOI 98<br />Centuries ago, King Arthur and the Knights of the Round Table used to meet every year on New Year's Day to celebrate their fellowship. In remembrance of these events, we consider a board game for one player, on which one ches原创 2011-01-05 01:51:00 · 307 阅读 · 0 评论 -
USACO: A Game
A Game<br />IOI'96 - Day 1<br />Consider the following two-player game played with a sequence of N positive integers (2 <= N <= 100) laid onto a game board. Player 1 starts the game. The players move alternately by selecting a number from either the left o原创 2011-01-05 03:10:00 · 268 阅读 · 0 评论 -
USACO: Shopping Offers
Shopping Offers<br />IOI'95<br />In a certain shop, each kind of product has an integer price. For example, the price of a flower is 2 zorkmids (z) and the price of a vase is 5z. In order to attract more customers, the shop introduces some special offers.原创 2011-01-03 00:22:00 · 371 阅读 · 0 评论 -
USACO: Stringsobits
StringsobitsKim SchrijversConsider an ordered set S of strings of N (1 This set of strings is interesting because it is ordered and contains all possible strings of length N that have L (1 Your task is to read a number I (1原创 2010-12-23 21:23:00 · 287 阅读 · 0 评论 -
POJ1085: Triangle War
Triangle WarTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 1489 Accepted: 595<br />DescriptionTriangle War is a two-player game played on the following triangular grid: <br /><br />Two players, A and B, take turns filling in any dotted line conn原创 2010-12-09 12:54:00 · 222 阅读 · 0 评论 -
SCUT J.O: 最大公共子串
最大公共子串<br />Time Limit:<br />1000MS Memory Limit:<br />10000KDescription<br />从一个给定的串中删去(不一定连续地删去)0个或0个以上的字符,剩下的字符按原来顺序组成的串是该串的子串。例如:“”,“a”,“xb”,“aaa”,“bbb”,“xabb”,“xaaabbb”都是串“xaaabbb”的子串。(例子中的串不包含引号。) <br />编程求N个非空串的最长公共子串的长度。限制:2≤N≤100;N个串中的字符只会是数字0,1,…原创 2010-12-02 01:44:00 · 275 阅读 · 0 评论 -
USACO: Longest Prefix
Longest Prefix<br />IOI'96<br />The structure of some biological objects is represented by the sequence of their constituents denoted by uppercase letters. Biologists are interested in decomposing a long sequence into shorter ones called primitives. <br />原创 2010-12-01 16:10:00 · 322 阅读 · 0 评论 -
USACO: The Castle
The Castle<br />IOI'94 - Day 1<br />In a stroke of luck almost beyond imagination, Farmer John was sent a ticket to the Irish Sweepstakes (really a lottery) for his birthday. This ticket turned out to have only the winning number for the lottery! Farmer Jo原创 2010-11-28 19:46:00 · 232 阅读 · 0 评论 -
USACO: Buy Low, Buy Lower
Buy Low, Buy LowerThe advice to "buy low" is half the formula to success in the stock market. But to be considered a great investor you must also follow this problems' advice: "Buy low, buy lower"That is, each time you buy a stock, you must purchase more a原创 2011-03-10 16:09:00 · 342 阅读 · 0 评论