USACO 5.3.4

计数DP
[方程]f[i][j] = min{f[i-1][j], f[i-1][j-1], f[i][j-1]} (0<=i,j<n)
[预处理]若G[i][j]=1则f[i][j]=1.
和 这题 方法一样.

Executing...
   Test 1: TEST OK [0.011 secs, 7996 KB]
   Test 2: TEST OK [0.000 secs, 7996 KB]
   Test 3: TEST OK [0.011 secs, 7996 KB]
   Test 4: TEST OK [0.000 secs, 7996 KB]
   Test 5: TEST OK [0.011 secs, 7996 KB]
   Test 6: TEST OK [0.011 secs, 7996 KB]
   Test 7: TEST OK [0.011 secs, 7996 KB]
   Test 8: TEST OK [0.011 secs, 7996 KB]
   Test 9: TEST OK [0.011 secs, 7996 KB]
   Test 10: TEST OK [0.032 secs, 7996 KB]
   Test 11: TEST OK [0.022 secs, 7996 KB]
   Test 12: TEST OK [0.022 secs, 7996 KB]
   Test 13: TEST OK [0.022 secs, 7996 KB]
   Test 14: TEST OK [0.022 secs, 7996 KB]
   Test 15: TEST OK [0.032 secs, 7996 KB]

All tests OK.

YOUR PROGRAM ('bigbrn') WORKED FIRST TIME! That's fantastic -- and a rare thing. Please accept these special automated congratulations.

[Code]

#include<stdio.h> const int MAXN = 1000+10; bool G[MAXN][MAXN] = {0}; int f[MAXN][MAXN] = {0}; int min(int a, int b, int c) { int ans = a; if (b < ans) ans = b; if (c < ans) ans = c; return ans; } int main() { FILE *fin, *fout; fin = fopen("bigbrn.in", "r"); fout = fopen("bigbrn.out", "w"); int N, T, i, j, x, y, ans = 0; fscanf(fin, "%d%d", &N, &T); for (i = 0; i < T; i++) { fscanf(fin, "%d%d", &x, &y); G[x][y] = 1; } for (i = 1; i <= N; i++) for (j = 1; j <= N; j++) if (!G[x][y]) f[i][j] =1; for (i = 1; i <= N; i++) for (j = 1; j <= N; j++) { if (!G[i][j]) f[i][j] = min(f[i-1][j], f[i-1][j-1], f[i][j-1])+1; if (f[i][j] > ans) ans = f[i][j]; } fprintf(fout, "%d/n", ans); }