JohnnyCashh

2D Array - DS

Sep 4th, 2018
109
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 0.93 KB | None | 0 0
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3.  
  4. int hourglassSum(vector<vector<int>> arr) {
  5.     int maxSum = -50000;
  6.     for(int i = 1; i < 5; ++i)
  7.         for(int j = 1; j < 5; ++j){
  8.             int previousLineSum = arr[i-1][j-1] + arr[i-1][j] + arr[i-1][j + 1];
  9.             int nextLineSum = arr[i+1][j-1] + arr[i+1][j] + arr[i+1][j + 1];
  10.             int currentSum = previousLineSum + nextLineSum + arr[i][j];
  11.             if(currentSum > maxSum)
  12.                 maxSum = currentSum;
  13.         }
  14.      return maxSum;
  15. }
  16.  
  17. int main()
  18. {
  19.     ofstream fout(getenv("OUTPUT_PATH"));
  20.  
  21.     vector<vector<int>> arr(6);
  22.     for (int i = 0; i < 6; i++) {
  23.         arr[i].resize(6);
  24.  
  25.         for (int j = 0; j < 6; j++) {
  26.             cin >> arr[i][j];
  27.         }
  28.  
  29.         cin.ignore(numeric_limits<streamsize>::max(), '\n');
  30.     }
  31.  
  32.     int result = hourglassSum(arr);
  33.  
  34.     fout << result << "\n";
  35.  
  36.     fout.close();
  37.  
  38.     return 0;
  39. }
Advertisement
Add Comment
Please, Sign In to add comment