Hackerrank/2d-array.cpp at master · shklqm/Hackerrank · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
#include <map>
#include <set>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <bitset>
#include <cstdio>
#include <limits>
#include <vector>
#include <climits>
#include <cstring>
#include <cstdlib>
#include <fstream>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <unordered_map>

using namespace std;


int main(){
    vector< vector<int> > arr(6,vector<int>(6));
    for(int arr_i = 0;arr_i < 6;arr_i++){
       for(int arr_j = 0;arr_j < 6;arr_j++){
          cin >> arr[arr_i][arr_j];
       }
    }
    int max = -100;
    for(int i=0; i<4; i++)
    {
        int temp = 0;
        for(int j=0; j<4; j++)
        {
            temp += arr[i][j];
            temp += arr[i][j+1];
            temp += arr[i][j+2];
            temp += arr[i+1][j+1];
            temp += arr[i+2][j];
            temp += arr[i+2][j+1];
            temp += arr[i+2][j+2];

            if(temp>=max)
                max = temp;
            temp = 0;
          }

    }

    cout<< max;

    return 0;
}