Problem-Solving/1676D at main · tamimsal/Problem-Solving · 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
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define debug(x) cout<<"[" << #x << " is:" << x << "] "<<endl;
#define endl '\n'
//By: Tamim


void solve() {
    int n,m;
    cin >> n >> m;

    int a[n][m];

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

        }
    }


    int ans =0;
    for(int i =0 ;i <n ; i++){
        for(int j = 0 ;j < m ; j++){
            int c = 0;
            int l = i, r = j;
            while (l < n && r < m)
            {
                if(l == n-1 || r == m-1){
                    c+=a[l][r];
                    break;
                }
                else{
                    c+=a[l][r];
                    l++;
                    r++;
                }
            }
            l = i, r = j;
            while (l >= 0 && r >= 0)
            {
                if(l == 0 || r == 0){
                    c+=a[l][r];
                    break;
                }
                else{
                    c+=a[l][r];
                    l--;
                    r--;
                }
            }
            l = i, r = j;
            while (l >= 0 && r < m)
            {
                if(l == 0 || r == m-1){
                    c+=a[l][r];
                    break;
                }
                else{
                    c+=a[l][r];
                    l--;
                    r++;
                }
            }
            l = i, r = j;
            while (l < n  && r >= 0)
            {
                if(l == n-1 || r == 0){
                    c+=a[l][r];
                    break;
                }
                else{
                    c+=a[l][r];
                    l++;
                    r--;
                }
            }
            c-= (3*a[i][j]);

            ans = max(ans,c);


        }
    }
    cout << ans << endl;


}

int32_t main() {

    ios::sync_with_stdio(false);cin.tie(0);
    cout.tie(0);
    int t =1 ;
    cin >>t;
    while (t--) {
        solve();
    }


    return 0;
}