vj1011 清帝之惑之顺æ

Vj1011 清帝之惑之顺æ

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
//±¾Ìâ¶ÁͼÊý×éÒª¿ªµ½ longint / //±ÉÈ˵ķ½·¨ //¼ÇÒ仯ËÑË÷ //Éè f[ i , j ] Ϊ ´Ó ( i , j ) »¬ÏµÄ×î´ó¸ß¶È //f [ i , j ] = max( f[ x , y] ) + 1 (x,y) Ϊ (i,j) µÄÏàÁÚµã ÇÒ g[x,y]<g[i,j] / const maxn=500; var n,m:integer; ans:longint; g,f:array[0. .maxn,0. .maxn] of longint; function max(x,y:longint):longint; begin if x>=y then exit(x); exit(y); end; procedure init; var i,j:integer; begin readln(n,m); for i:=1 to n do for j:=1 to m do read(g[i,j]); end; function dfs(x,y:integer):longint; var a,b,c,d:integer; begin
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 2
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.

Page1 / 2

Vj1011 &aelig;&cedil;…&aring;&cedil;&auml;&sup1;‹&aelig;ƒ‘&auml;&sup1;‹&eacute;&iexcl;&ordm;&aelig;

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online