백준 11048: 이동하기

#include <iostream>
#include <algorithm>
using namespace std;
int candy[1002][1002];
int d[1002][1002];
int r,c;
 
int main()
{
    cin >> r >> c;
    for (int i = 1;i <= r; ++i)
    for (int j = 1; j <= c; ++j)
    {
        cin >> candy[i][j];
    }
    
    for (int i = 1; i <= r; ++i)
    for (int j = 1; j <= c; ++j)
    {
        d[i][j] = max(max(d[i - 1][j], d[i - 1][j - 1]), d[i][j - 1]) + candy[i][j];
    }
    cout << d[r][c] << endl;
    return 0;
}

#include <iostream>
#include <algorithm>
using namespace std;
int candy[1002][1002];
int d[1002][1002];
int r,c;
 
int main()
{
    cin >> r >> c;
    for (int i = 1;i <= r; ++i)
    for (int j = 1; j <= c; ++j)
    {
        cin >> candy[i][j];
    }
    d[1][1] = candy[1][1];
    for (int i = 1; i <= r; ++i)
    for (int j = 1; j <= c; ++j)
    {
        if (i + 1 <= r && d[i + 1][j] < d[i][j] + candy[i + 1][j])
            d[i + 1][j] = d[i][j] + candy[i + 1][j];
        if (j + 1 <= c && d[i][j+1] < d[i][j] + candy[i][j+1])
            d[i][j + 1] = d[i][j] + candy[i][j + 1];
        if (j + 1 <= c && i + 1 <= r && d[i + 1][j + 1] < d[i][j] + candy[i + 1][j + 1])
            d[i + 1][j + 1] = d[i][j] + candy[i + 1][j + 1];
    }
    cout << d[r][c] << endl;
    return 0;
}