与‘DP-线性DP’有关的日志

poj2181

maksyuki 发表于 oj 分类,标签:
0
poj2181

Jumping Cows

Farmer John's cows would like to jump over the moon, just like the cows in their favorite nursery rhyme. Unfortunately, cows can not jump. The local witch doctor has mixed up P (1 <= P <= 150,000) potions to aid the cows in their >>继续阅读

poj1953

maksyuki 发表于 oj 分类,标签:
0
poj1953

World Cup Noise

"KO-RE-A, KO-RE-A" shout 54.000 happy football fans after their team has reached the semifinals of the FIFA World Cup in their home country. But although their excitement is real, the Korean people are still very organized by nature >>继续阅读

poj1664

maksyuki 发表于 oj 分类,标签:
0
poj1664

放苹果

把M个同样的苹果放在N个同样的盘子里,允许有的盘子空着不放,问共有多少种不同的分法?(用K表示)5,1,1和1,5,1 是同一种分法。

Input >>继续阅读

poj1018

maksyuki 发表于 oj 分类,标签:
0
poj1018

Communication System

We have received an order from Pizoor Communications Inc. for a special communication system. The system consists of several devices. For each device, we are free to choose from several manufacturers. Same devices from two manu >>继续阅读

poj1745

maksyuki 发表于 oj 分类,标签:
0
poj1745

Divisibility

Consider an arbitrary sequence of integers. One can place + or - operators between integers in the sequence, thus deriving different arithmetical expressions that evaluate to different values. Let us, for example, take the sequence: 17 >>继续阅读

poj1844

maksyuki 发表于 oj 分类,标签: ,
0
poj1844

Sum

Consider the natural numbers from 1 to N. By associating to each number a sign (+ or -) and calculating the value of this expression we obtain a sum S. The problem is to determine for a given sum S the minimum number N for which we can obtain S >>继续阅读

poj3666

maksyuki 发表于 oj 分类,标签:
0
poj3666

Making the Grade

A straight dirt road connects two fields on FJ's farm, but it changes elevation more than FJ would like. His cows do not mind climbing up or down a single slope, but they are not fond of an alternating succession of hills and valle >>继续阅读

poj1548

maksyuki 发表于 oj 分类,标签: ,
0
poj1548

Robots

Your company provides robots that can be used to pick up litter from fields after sporting events and concerts. Before robots are assigned to a job, an aerial photograph of the field is marked with a grid. Each location in the grid that cont >>继续阅读

poj1065

maksyuki 发表于 oj 分类,标签: ,
0
poj1065

Wooden Sticks

There is a pile of n wooden sticks. The length and weight of each stick are known in advance. The sticks are to be processed by a woodworking machine in one by one fashion. It needs some time, called setup time, for the machine to pre >>继续阅读

poj3046

maksyuki 发表于 oj 分类,标签:
0
poj3046

Ant Counting

Bessie was poking around the ant hill one day watching the ants march to and fro while gathering food. She realized that many of the ants were siblings, indistinguishable from one another. She also realized the sometimes only one ant w >>继续阅读

poj3160

maksyuki 发表于 oj 分类,标签: ,
0
poj3160

Father Christmas flymouse

After retirement as contestant from WHU ACM Team, flymouse volunteered to do the odds and ends such as cleaning out the computer lab for training as extension of his contribution to the team. When Christmas came, flymouse >>继续阅读

hdu1078

maksyuki 发表于 oj 分类,标签:
0
hdu1078

FatMouse and Cheese

Problem Description

FatMouse 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 each grid location >>继续阅读

poj3616

maksyuki 发表于 oj 分类,标签:
0
poj3616

Milking Time

Bessie is such a hard-working cow. In fact, she is so focused on maximizing her productivity that she decides to schedule her next N (1 ≤ N ≤ 1,000,000) hours (conveniently labeled 0..N-1) so that she produces as much milk as possible. >>继续阅读

hdu1260

maksyuki 发表于 oj 分类,标签:
0
hdu1260

Tickets

Problem Description

Jesus, what a great movie! Thousands of people are rushing to the cinema. However, this is really a tuff time for Joe who sells the film tickets. He is wandering when could he go back home as early as possible.A good a >>继续阅读

hdu1176

maksyuki 发表于 oj 分类,标签:
0
hdu1176

免费馅饼

Problem Description

都说天上不会掉馅饼,但有一天gameboy正走在回家的小径上,忽然天上掉下大把大把的馅饼。说来gameboy的人品实在是太好了,这馅饼别处都不掉,就掉落在他身旁的10米范围内。 >>继续阅读

hdu1257

maksyuki 发表于 oj 分类,标签:
0
hdu1257

最少拦截系统

Problem Description

某国为了防御敌国的导弹袭击,发展出一种导弹拦截系统.但是这种导弹拦截系统有一个缺陷:虽然它的第一发炮弹能够到达任意的高度,但是以后每一发炮弹都不能超过前一发的高度.某天, >>继续阅读