| ||||||||||
| Online Judge | Problem Set | Authors | Online Contests | User | ||||||
|---|---|---|---|---|---|---|---|---|---|---|
| Web Board Home Page F.A.Qs Statistical Charts | Current Contest Past Contests Scheduled Contests Award Contest | |||||||||
1000题动态规划法program poj1000;
var
f:array[0..10,0..10] of integer;
i,j:integer;
a,b:integer;
function max(x,y:integer):integer;
begin
if x>y then exit(x) else exit(y);
end;
begin
readln(a,b);
for i:=0 to a do f[a,0]:=i;
for j:=0 to b do f[0,b]:=j;
for i:=1 to a do
for j:=1 to b do
begin
f[i,j]:=max(f[i-1,j]+1,f[i,j-1]+1);
end;
writeln(f[a,b]);
end.
Followed by: Post your reply here: |
All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di
Any problem, Please Contact Administrator