codeforces/codeforces/1676/D.cpp at main · ychaaibi/codeforces · 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
#include <algorithm>
#include <iostream>
#include <cmath>
#include <vector>

using namespace	std;

int		left_diago_sum(vector<vector<int> > matrix, int i, int j)
{
	int	sum = 0;
	int	dist = 1;

	//cout << matrix.size() << endl;
	while (i - dist >= 0 && j - dist >= 0)
	{
		sum += matrix[i - dist][j  - dist];
		dist++;
	}
	dist = 1;
	while (i + dist < matrix.size() && j + dist < matrix[i + dist].size())
	{
		sum += matrix[i + dist][j + dist];
		dist++;
	}
	return (sum);
}

int		right_diag_sum(vector<vector<int> > matrix, int i, int j)
{
	int	sum = 0;
	int	dist = 1;
	//cout << matrix.size() << endl;
	while (i - dist >= 0 && j + dist < matrix[i - dist].size())
	{
		sum += matrix[i - dist][j + dist];
		dist++;
	}
	dist = 1;
	while (i + dist < matrix.size() && j - dist >= 0)
	{
		sum += matrix[i + dist][j - dist];
		dist++;
	}
	return (sum);
}

void	solve(vector<vector<int> > matrix)
{
	int						m = -1;
	int						i = 0, j = 0;

	while (i < matrix.size())
	{
		j = 0;
		while (j < matrix[i].size())
		{
			m = max(m, matrix[i][j] + right_diag_sum(matrix, i, j) + left_diago_sum(matrix, i, j));
			j++;
		}
		i++;
	}
	cout << m << endl;
}

void	parse()
{
	int	n, m;
	int	i = -1, j;
	int	val;

	cin >> n >> m;
	vector<vector<int> >	matrix(n);
	while (++i < n)
	{
		j = -1;
		while (++j < m)
		{
			cin >> val;
			matrix[i].push_back(val);
		}
	}
	solve(matrix);
}


int main()
{
	int	testCases;

	cin >> testCases;
	while (testCases--)
		parse();
	return (0);
}