테트로미노 - 14500

문제 : 

https://www.acmicpc.net/problem/14500

14500번: 테트로미노

 

소스 :

#include <iostream>

using namespace std;

int main()
{
	int n, m;
	cin >> n >> m;
	//각 도형의 모형(회전, 대칭 고려)
	int col[19][4] =
	{
		{0,1,2,3},
		{0,0,0,0},
		{0,1,2,2},
		{0,0,0,1},
		{0,0,1,2},
		{0,1,1,1},
		{0,0,1,1},
		{0,1,1,2},
		{0,0,1,1},
		{0,1,1,2},
		{0,0,1,1},
		{0,1,2,2},
		{0,1,1,1},
		{0,0,1,2},
		{0,0,0,1},
		{0,0,0,1},
		{0,1,1,2},
		{0,1,1,1},
		{0,1,1,2}
	};
	int row[19][4] =
	{
		{0,0,0,0},
		{0,1,2,3},
		{0,0,0,1},
		{0,1,2,0},
		{0,1,1,1},
		{2,0,1,2},
		{0,1,0,1},
		{0,0,1,1},
		{1,2,0,1},
		{1,0,1,0},
		{0,1,1,2},
		{1,1,0,1},
		{0,0,1,2},
		{0,1,0,0},
		{0,1,2,2},
		{0,1,2,1},
		{0,0,1,0},
		{1,0,1,2},
		{1,0,1,1}
	};

	int temp[500][500];
	for (int i = 0; i < n; i++)
	{
		for (int j = 0; j < m; j++)
		{
			cin >> temp[i][j];
		}
	}

	int total = 0;
	int sol = 0;
	for (int i = 0; i < n; i++) // 전체 행
	{
		for (int j = 0; j < m; j++) //전체 열
		{
			for (int c = 0; c < 19; c++) // 도형 케이스
			{
				total = 0;
				for (int k = 0; k < 4; k++) //블럭 4개
				{
					int h = i + col[c][k];
					int w = j + row[c][k];
					if (h >= n || w >= m)
					{
						break;
					}
					total += temp[h][w];
				}
				if (sol < total)
				{
					sol = total;
				}
			}
		}
	}
	cout << sol << endl;
	return 0;
}