最大子矩阵

#include "stdafx.h"
#include <iostream>
#include <stdio.h>
#include <vector>
#include <assert.h>

using namespace std;
vector<int> vec;

int Char2Int(char *a, int n);
char LastChar(char *a, int n);

typedef struct tagMatrixInfo
{
    int i32nLine;
    int i32nCol;

    tagMatrixInfo()
    {
        i32nLine = i32nCol = 0;
    }
}S_MatrixInfo;


S_MatrixInfo GetMax2X2Matrix(int **ppMatrix, int nLine, int nCol)
{
    assert(ppMatrix);
    assert(nLine >= 2);
    assert(nCol >= 2);

    S_MatrixInfo sMaxMatrixInfo;

    int nMaxValue = 0, nTempValue = 0;
    for (int i32I = 0; i32I < nLine - 1; i32I++)
    {
        for (int i32J = 0; i32J < nCol - 1; i32J++)
        {
            nTempValue += (ppMatrix[i32I][i32J] + ppMatrix[i32I][i32J + 1]);
            nTempValue += (ppMatrix[i32I + 1][i32J] + ppMatrix[i32I + 1][i32J + 1]);

            if (nTempValue > nMaxValue)
            {
                nMaxValue = nTempValue;
                sMaxMatrixInfo.i32nLine = i32I;
                sMaxMatrixInfo.i32nCol = i32J;
            }
            nTempValue = 0;
        }
    }

    return sMaxMatrixInfo;
}

int main(void)
{

    int i32I = 0, i32J = 0;
    int i32nLine = 0, i32nCol = 0;
    char temp[10];
    char a;
    int count = 0,temp1=0;
    while (a=cin.get() != '
')
    {
        cin.unget();
        cin >> temp;

        if (LastChar(temp,10) == ';')
        {
            if (i32nCol == 0)
            {
                i32nCol = vec.size()+1;
            }
            i32nLine++;
        }
        vec.push_back(Char2Int(temp, 8));
    }
    i32nLine++;
    cout << i32nLine << "行，" << i32nCol << "列。" << endl;
    vector<int>::iterator it;
    for (it = vec.begin(); it != vec.end(); it++)
    {
        count++;
        if (count%i32nCol == 0)
        {
            cout << *it << ' '<<endl;
        }
        else
        {
            cout << *it << ' ';
        }
        
    }

    int **ppMatrix = new int *[i32nLine];
    assert(ppMatrix);

    for (i32I = 0; i32I < i32nLine; i32I++)
    {
        ppMatrix[i32I] = new int[i32nCol];
        assert(ppMatrix[i32I]);

        for (i32J = 0; i32J < i32nCol; i32J++)
        {
             ppMatrix[i32I][i32J]=vec[i32I*i32nCol+i32J];
        }
    }

    S_MatrixInfo sMaxMatrixInfo = GetMax2X2Matrix(ppMatrix, i32nLine, i32nCol);
    cout << endl << "最大的二维矩阵为:" << endl;
    for (i32I = sMaxMatrixInfo.i32nLine; i32I < sMaxMatrixInfo.i32nLine + 2; i32I++)
    {
        for (i32J = sMaxMatrixInfo.i32nCol; i32J < sMaxMatrixInfo.i32nCol + 2; i32J++)
        {
            cout << ppMatrix[i32I][i32J] << " ";
        }
        cout << endl;
    }

    return 0;


}

int Char2Int(char *a, int n)
{
    if (a == NULL)
    {
        return 0;
    }
    int i = 0;
    int result = 0;
    while (a[i] != NULL)
    {
        if (a[i] != ';')
        {
            result *= 10;
            result += a[i] - '0';

        }
        i++;


    }
    return result;

}

char LastChar(char *a, int n)
{
    int i = 0;
    int j = 0;
    while (a[i] != NULL)
    {
        j = i;
        i++;
    }

    return a[j];
}