energy：
CODE:
{
Problem: Noip 2006 Problem 1
Algorithm: Dynamic Programming
}
const
maxn = 100;
var
n, i, j, k, p, ans:longint;
data:array[1..maxn,1..2] of longint;
dp:array[1..maxn,1..maxn] of longint;
function max(a, b:longint):longint;
begin
if a > b then max:=a else max:=b;
end;
……
[本部分内容设定了加密]