ss1010 马��河�

ss1010 马��河� - / /dp / /f[ i ,...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
//±ÉÈ˵ķ½·¨ //dp //f[ i , j ] = f[ i - 1 , j ] + f[ i , j-1 ] / //±ÉÈ˵ÄÎÊÌâ //·¶Î§Ã»ÏëºÃ ¹æģûËãÇå ×î´ó½âӦΪ C( 30 , 15 ) / const maxn=15; dx:array[0. .8] of integer=(0,-2,-1,1,2,2,1,-1,-2); dy:array[0. .8] of integer=(0,1,2,2,1,-1,-2,-2,-1); var n,m,x,y:integer; f:array[-1. .maxn,-1. .maxn] of longint; procedure init; begin readln(n,m,x,y); end; function check(p,q:integer):boolean; var i,tx,ty:integer; begin for i:=0 to 8 do begin tx:=x+dx[i]; ty:=y+dy[i];
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 02/21/2011 for the course CS 001 taught by Professor 001 during the Spring '11 term at Shandong University.

Ask a homework question - tutors are online