二维数组最大和，怎么办

Question

在二维数组每行找一个数，求这些数和最大，要求是相邻两行的数不在同一列

Answer 1

#include<string>
#include<iostream>
#include<map>
using namespace std;
#define _max 0
int main(){
    map<int,int> nums;
    cout<<"请输入二维数组:"<<endl;
    cout<<"行:";
    int row,col;
    cin>>row;
    cout<<"列:";
    cin>>col;
    int a[row][col];
    for(int i=0; i<row; i++){
        int row_max=_max;
        int vol_v;
        for(int j=0; j<col; j++){
            cin>>a[i][j];
            if(a[i][j]>row_max&&nums.count(j)==0&&nums.count(j-1)==0&&nums.count(j+1)==0){
                row_max=a[i][j];
                vol_v=j;
            }
        }
        nums[vol_v]=row_max;
    }
    map<int, int>::iterator iter;
    int ans=0;
    for(iter=nums.begin(); iter!=nums.end(); iter++){
        cout<<iter->first<<" "<<iter->second<<endl;
        ans+=iter->second;
    }
    cout<<"和:"<<ans<<endl;
    return 0;
}