zoj 1019 Illusive chase

题目比较长，读起来麻烦...英语不好，理解不行。

数据：

row[i][j],cloumn[i][j]记录i,j左边，上面有多少障碍。

追踪旅行的数据结构:

struct step

{

   int x, y;

   char direct;

}chase[maxTrip];

算法：

对区间[x,y]进行全面搜索。对每次(x,y),到(x0,y0)之间，判断是否有障碍。

ac代码：

#include <stdio.h> #define MAX 101 #define maxTrip 10000 struct step { int x, y; char direct; }chase[maxTrip]; int field[MAX][MAX]; int row[MAX][MAX], column[MAX][MAX]; int m, n; int ans; int trip; int found; int max(int x, int y) { return (x>y)?x:y; } int min(int x, int y) { return (x<y)?x:y; } void initialize() { int i, j; scanf("%d%d", &m, &n); for(i = 1; i <= m; i++) for(j = 1 ;j <= n; j++) scanf("%d", &field[i][j]); for(i = 1; i <= m; i++) for(j = 1 ;j <= n; j++) row[i][j] = row[i][j-1] + field[i][j]; for(i = 1; i <= m; i++) for(j = 1 ;j <= n; j++) column[j][i] = column[j-1][i] + field[j][i]; trip = 0; int from, to; while(scanf("%d%d", &from, &to) && (from || to)) { chase[trip].x = from; chase[trip].y = to; scanf(" %c", &chase[trip].direct); ++trip; } } void search(int step, int x, int y) { int i; if (found) return; if (step==trip) { ++ans; found = 1; return; } for( i = chase[step].x; i <= chase[step].y; i++) { int x0 = x, y0 = y; switch(chase[step].direct) { case 'R': y0+=i;break; case 'L': y0-=i;break; case 'U': x0-=i;break; case 'D': x0+=i;break; } if(x0>=1 && x0<=m && y0>=1 && y0<=n) { switch(chase[step].direct) { case 'R': case 'L': if(row[x0][max(y,y0)] == row[x0][min(y,y0)-1]) search(step+1,x0,y0); break; case 'U': case 'D': if(column[max(x,x0)][y0] == column[min(x,x0)-1][y0]) search(step+1,x0,y0); break; } } } } int main() { int i, j; for(i=1;i<=m;++i) row[i][0] = 0; for(i=1;i<=n;++i) column[0][i] = 0; int iCase; scanf("%d", &iCase); while(iCase--) { initialize(); ans = 0; for(i=1;i<=m;++i) for(j=1;j<=n;++j) if(!field[i][j]) { found = 0; search(0,i,j); } printf("%d/n",ans); } return 0; }