NOIP201008引水入城

支持亿下吧！

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>

using namespace std;
int n,m,ans;
int a[510][510],vis[510][510],l[510],r[510],f[510];
const int inf = 100000000;

void dfs1(int x,int y)
{
    if (vis[x][y])
    return;
    vis[x][y] = 1;
    if (x+1<=n && a[x][y]>a[x+1][y]) dfs1(x+1,y);
    if (x-1>=1 && a[x][y]>a[x-1][y]) dfs1(x-1,y);
    if (y+1<=m && a[x][y]>a[x][y+1]) dfs1(x,y+1);
    if (y-1>=1 && a[x][y]>a[x][y-1]) dfs1(x,y-1);
    return;
}

void dfs2(int back,int x,int y)
{
    if (vis[x][y])
    return;
    if (x == 1)
    l[y] = back;
    vis[x][y] = 1;
    if (x+1<=n && a[x][y]<a[x+1][y]) dfs2(back,x+1,y);
    if (x-1>=1 && a[x][y]<a[x-1][y]) dfs2(back,x-1,y);
    if (y+1<=m && a[x][y]<a[x][y+1]) dfs2(back,x,y+1);
    if (y-1>=1 && a[x][y]<a[x][y-1]) dfs2(back,x,y-1);
    return;
}

void dfs3(int back,int x,int y)
{
    if (vis[x][y])
    return;
    if (x == 1)
    r[y] = back;
    vis[x][y] = 1;
     if (x+1<=n && a[x][y]<a[x+1][y]) dfs3(back,x+1,y);
    if (x-1>=1 && a[x][y]<a[x-1][y]) dfs3(back,x-1,y);
    if (y+1<=m && a[x][y]<a[x][y+1]) dfs3(back,x,y+1);
    if (y-1>=1 && a[x][y]<a[x][y-1]) dfs3(back,x,y-1);
    return;
}

int main()
{
    scanf("%d%d",&n,&m);
    for (int i = 1; i <= n; i++)
    for (int j = 1; j <= m; j++)
    scanf("%d",&a[i][j]);
    for (int i = 1; i <= m; i++)
    dfs1(1,i);
    for (int i = 1; i <= m; i++)
    if (vis[n][i] == 0)
    ans++;
    if (ans)
    {
    printf("0\n%d",ans);
    return 0;
}
    memset(vis,0,sizeof(vis));
    for (int i = 1; i <= m; i++)
    dfs2(i,n,i);
    memset(vis,0,sizeof(vis));
    for (int i = m; i >= 1; i--)
    dfs3(i,n,i);
    for (int i = 1; i <= m; i++)
    f[i] = inf;
    f[0] = 0;
    for (int i = 1;i <= m; i++)
    for (int j = 1;j <= m; j++)
    if (l[j] <= i && r[j] >= i)
    f[i] = min(f[i],f[l[j] - 1] + 1);
    printf("1\n%d",f[m]);
    
    return 0;
}