JS_Shining

摘要： 第一篇文章就弄个水题吧。。范围太小，DP或者搜索都可以过，就是无解的判断容易弄错。Code:var f:array [0..201,0..201,0..201] of longint; a:array [0..201,0..201] of longint; n,m,k,i,j,v,bx,by,ex,ey:longint; function max(a,b:longint):longint; begin if a>b then exit(a) else exit(b); end; begin readln(n,m,k); readln(bx,by,ex,ey)... 阅读全文