2001. 파리 퇴치

2001. 파리 퇴치

문제출처: https://www.swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AV5PzOCKAigDFAUq&categoryId=AV5PzOCKAigDFAUq&categoryType=CODE

풀이 방법

<코드>

#include<iostream>
#include <cstring>
using namespace std;

int CheckTotal(int* pointer, int nSize, int mSize)
{
	int sum{ 0 };

	for (int i = 0; i < mSize; i++)
		for (int j = 0; j < mSize; j++)
			sum += *(pointer + (nSize * i) + j);

	return sum;
}

int main(int argc, char** argv)
{
	std::ios::sync_with_stdio(false);
	std::cout.tie(nullptr);
	std::cin.tie(nullptr);

	int test_case;
	int T;
	cin >> T;

	for (test_case = 1; test_case <= T; ++test_case)
	{
		int nValue{ 0 }, mValue{ 0 };
		std::cin >> nValue >> mValue;

		int* dataArray = new int[nValue*nValue];
		for (int i = 0; i < nValue; i++)
			for (int j = 0; j < nValue; j++)
				std::cin >> dataArray[i*nValue + j];

		int max{ 0 };
		for (int i = 0; i < nValue - mValue + 1; i++)
			for (int j = 0; j < nValue - mValue + 1; j++)
			{
				int sum = CheckTotal(&dataArray[i*nValue + j], nValue, mValue);
				if (max < sum)
					max = sum;
			}

		std::cout << "#" << test_case << " " << max << "\n";
		delete[] dataArray;
	}
}