Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- using namespace std;
- int matrix[16][16];
- int main() {
- int testCase;
- int testSize;
- int grabberSize;
- cin >> testCase;
- int *result = new int[testCase];
- for (int l = 0; l < testCase; l++) {
- cin >> testSize >> grabberSize;
- for (int i = 1; i <= testSize; i++) {
- for (int j = 1; j <= testSize; j++) {
- cin >> matrix[i][j];
- }
- }
- int max = -1;
- int tempSum;
- for (int i = 1; i <= (testSize - grabberSize - 1); i++) {
- grabberSize = 0;
- for (int j = 1; j <= (testSize - grabberSize - 1); j++) {
- for (int k = 0; k < grabberSize; k++) {
- tempSum = 0;
- for (int m = 0; m < grabberSize; m++) {
- tempSum += matrix[i + k][j + m];
- }
- }
- }
- }
- for (int i = 1; i < testSize - 1; i++) {
- tempSum = 0;
- for (int j = 1; j < testSize - 1; j++) {
- tempSum += matrix[i][j];
- tempSum += matrix[i][j+1];
- tempSum += matrix[i+1][j];
- tempSum += matrix[i+1][j + 1];
- if (max < tempSum)
- max = tempSum;
- }
- result[l] = max;
- }
- }
- for (int l = 0; l < testCase; l++)
- cout << "#" << l + 1 << " " << result[l] << endl;
- delete[] result;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement