与‘DP-区间DP’有关的日志

poj1179

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

Polygon

Polygon is a game for one player that starts on a polygon with N vertices, like the one in Figure 1, where N=4. Each vertex is labelled with an integer and each edge is labelled with either the symbol + (addition) or the symbol * (product). >>继续阅读

poj3280

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

Cheapest Palindrome

Keeping track of all the cows can be a tricky task so Farmer John has installed a system to automate it. He has installed on each cow an electronic ID tag that the system will read as the cows pass by a scanner. Each ID tag's co >>继续阅读

hdu5115

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

Dire Wolf

Problem Description

Dire wolves, also known as Dark wolves, are extraordinarily large and powerful wolves. Many, if not all, >>继续阅读

poj3186

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

Treats for the Cows

FJ has purchased N (1 <= N <= 2000) yummy treats for the cows who get money for giving vast amounts of milk. FJ sells one treat per day and wants to maximize the money he receives over a given period time.

The treats are >>继续阅读

poj2955

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

Brackets

We give the following inductive definition of a “regular brackets” sequence:

the empty sequence is a regular brackets sequence,

if s is a regular brackets sequence, then (s) and [s] are regular brackets sequences, and

if a and b a >>继续阅读

poj1651

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

Multiplication Puzzle

The multiplication puzzle is played with a row of cards, each containing a single positive integer. During the move player takes one card out of the row and scores the number of points equal to the product of the number on the >>继续阅读

vijos1312

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

描述

在Mars星球上,每个Mars人都随身佩带着一串能量项链。在项链上有N颗能量珠。能量珠是一颗有头标记与尾标记的珠子,这些标记对应着某个正整数。并且,对于相邻的两颗珠子,前一颗珠子的尾标记一定等于后一颗珠子的头标记。因为只有这样,通过吸盘(吸盘是Mars人吸收能量的一种器官)的作用, >>继续阅读

bzoj3229

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

3229: [Sdoi2008]石子合并

Description

在一个操场上摆放着一排N堆石子。现要将石子有次序地合并成一堆。规定每次只能选相邻的2堆石子合并成新的一堆,并将新的一堆石子数记为该次合并的得分。

试设计一个算法,计算出将N堆石子合并成一堆的最小得分。

>>继续阅读