网易互娱十字斩

十字斩

#include <bits/stdc++.h>
#include <string>
#include <vector>
#include <cmath>
#include <algorithm>
using namespace std;

// 十字斩后变形后的矩阵
vector<vector<int>> bianxing(vector<vector<int>> nums,int n,int m) {
	int len = nums.size();
	vector<vector<int>> vec(len-1, vector<int>(len-1,0));

//	printf("%d%d",n,m);
	for(int i=0; i<len; i++) {
		for(int j = 0; j<len; j++) {
			if(i < (n-1) && j<(m-1)) {
				vec[i][j] = nums[i][j];
			} else if(i > (n-1) && j>(m-1)) {
				vec[i-1][j-1] = nums[i][j];
			} else if(i>(n-1)) {
				vec[i-1][j] = nums[i][j];
			} else if(j>(m-1)) {
				vec[i][j-1] = nums[i][j];
			}
		}
	}

	return vec;
}
// 返回当前应该斩杀的坐标值
vector<int> summax(vector<vector<int>> nums) {
	int len = nums.size();
	vector<int> res(2,0);
//	vector<vector<int>> dp(len, vector<int>(len));
	int tempmax = INT_MIN;
	for(int i = 0; i<len; i++) {
		for(int j = 0; j<len; j++) {

			int sum = 0;
			for(int k = 0; k<len; k++) {
				sum+= nums[i][k];
			}
			for(int k = 0; k<len; k++) {
				sum+= nums[j][k];
			}
			sum = sum - nums[i][j];

			if(tempmax < sum) {
				tempmax = sum;
				res[0] = i+1;
				res[1] = j+1;
			}
		}
	}
	return res;
}


int main() {
	int N;
	cin >> N;

	vector<vector<int>> vec(N, vector<int>(N));
	vector<vector<int>> ans(N, vector<int>(2));

	// 输入
	for (int i = 0; i < N; ++i)	{
		for (int j = 0; j < N; ++j)	{
			int x;
			cin >> x;
			vec[i][j] = x;
		}
	}


	for(int i = 0; i<N; i++) {

		ans[i]=summax(vec);
		int n = ans[i][0];
		int m = ans[i][1];
		int len = vec.size();
		vector<vector<int>> temp(len-1, vector<int>(len-1,0));
		temp = bianxing(vec,n,m);
		vec = temp;

	}

	// 输出
	for (int i = 0; i < N; ++i)	{

		if(i== (N-1)) {
			cout<<ans[i][0]<<" "<<ans[i][1];
		} else
			cout<<ans[i][0]<<" "<<ans[i][1]<<endl;

	}

	return 0;
}