CTDL-GT/maximum_path_sum.cpp at main · ThangQT2606/CTDL-GT · 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
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int Mod = 1e9 + 7;
int n, m;
ll dp[105][105];
int main()
{
    cin >> n >> m;
    ll a[n+1][m+1];
    for(int i = 1; i <= n; i++)
    {
        for(int j = 1; j <= m; j++)
        {
            cin >> a[i][j];
        }
    }
    for(int i = 1; i <= n; i++)
    {
        for(int j = 1; j <= m; j++)
        {
            if(i == 1)
            {
                if(j == 1)
                {
                    dp[i][j] = a[i][j];
                }
                else
                {
                    dp[i][j] = dp[i][j-1] + a[i][j];
                }
            }
            else
            {
                if(j == 1)
                {
                    dp[i][j] = dp[i-1][j] + a[i][j];
                }
                else
                {
                    dp[i][j] = max(dp[i][j-1], dp[i-1][j]) + a[i][j];
                }
            }
        }
    }
    cout << dp[n][m] << endl;
}