滴滴快的笔试题：最大子矩阵

深藏阁楼爱情的钟 2022-08-08 19:48 94阅读 0赞

![20150925215359271][]![20150925215410765][]

#include <iostream>
    #include <string.h>
    #include <string>
    #include <sstream>
    using namespace std;
    
    int main(void)
    {
        string line;
    
        getline(cin, line);
        char *str = new char[line.size() + 1];
    
        strcpy(str, line.c_str());
        char *pstart = str;
        int raw = 1;
        int colum = 0;
        while (pstart && *pstart)
        {
            if (*pstart == ';')
            {
                raw++;
                *pstart = ' ';
            }
            pstart++;
        }
        line = str;
    
        string lineTmp = line;
        stringstream in(line), intmp(lineTmp);
    
        int tmp;
        int cnt = 0;
        while (intmp >> tmp)
            cnt++;
    
        colum = cnt / raw;
    
        int *arr = new int[raw * colum];
        for (int i = 0; i < raw; i++)
        {
            for (int j = 0; j < colum; j++)
            {
                in >> tmp;
                arr[i * colum + j] = tmp;
            }
        }
    
        int sum = 0, max = 0;
        for (int i = 0; i < raw - 1; i++)
        {
            for (int j = 0; j < colum - 1; j++)
            {
                sum = 0;
    
                sum += arr[i * colum + j];
                sum += arr[i * colum + j + 1];
                sum += arr[(i + 1) * colum + j];
                sum += arr[(i + 1) * colum + j + 1];
    
                if (sum > max)
                max = sum;
            }
        }
    
        cout << max << endl;
    
        delete []str;
        return 0;
    }

[20150925215359271]: https://img-blog.csdn.net/20150925215359271
[20150925215410765]: /images/20220731/b92aed101b074a9e9e1a9d0832213442.png