ZOJ-3048

好久没刷了，这题很早就想做了，挺有意思的，就是消方块的游戏，核心就是搜连通块，没啥难度，细心点就行

#include<stdio.h>
#include<string.h>

static int n, m, a[20][20];

static void adjust_block()
{
    int i, j, index, temp[20], t[20][20];
    for (j = 0; j < m; j++)
    {
        memset(temp, 0, 20 * sizeof(int));
        index = 0;
        for (i = n - 1; i >= 0; i--)
            if (a[i][j])
                temp[index++] = a[i][j];
        for (i = n - 1; i >= 0; i--)
            a[i][j] = temp[n - 1 - i];
    }

    memset(t, 0, 20 * 20 * sizeof(int));
    index = 0;
    for (j = 0; j < m; j++)
    {
        if (a[n - 1][j])
        {
            for (i = 0; i < n; i++)
                t[i][index] = a[i][j];
            index++;
        }
    }
    memcpy(a, t, 20 * 20 * sizeof(int));
}

static int dfs(int row, int col)
{
    int sum = 0, temp;
    if (!a[row][col])
        return sum;
    temp = a[row][col];
    a[row][col] = 0;
    sum += 1;
    if (row - 1 >= 0 && a[row - 1][col] == temp)
        sum += dfs(row - 1, col);
    if (row + 1 < n && a[row + 1][col] == temp)
        sum += dfs(row + 1, col);
    if (col - 1 >= 0 && a[row][col - 1] == temp)
        sum += dfs(row, col - 1);
    if (col + 1 < m && a[row][col + 1] == temp)
        sum += dfs(row, col + 1);
    return sum;
}

static int find_max_block(int *row, int *col)
{
    int i, j, max = -1, save[20][20];
    memcpy(save, a, 20 * 20 * sizeof(int));
    for (i = 0; i < n; i++)
        for (j = 0; j < m; j++)
        {
            int t = dfs(i, j);
            if (t > max)
            {
                max = t;
                *row = i;
                *col = j;
            }
        }
    memcpy(a, save, 20 * 20 * sizeof(int));
    return max;
}

int main()
{
    while (scanf("%d %d", &n, &m) != EOF)
    {
        getchar();
        int i, j;
        for (i = 0; i < n; i++)
        {
            for (j = 0; j < m; j++)
                a[i][j] = getchar() - '0';
            getchar();
        }

        int row, col, total = 0, res = find_max_block(&row, &col);
        while (res > 1)
        {
            total += res * (res - 1);
            dfs(row, col);
            adjust_block();
            res = find_max_block(&row, &col);
        }
        printf("%d\n", total);
    }
    return 0;
}