1932 숫자삼각형

BOJ::1932 숫자삼각형

https://www.acmicpc.net/problem/1932

dp 문제이다.

d배열의 각 지점마다 올 수 있는 최대값을 저장해주면서 끝까지 가면 된다.

<JAVA>

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
 
public class Main {
    
    static int n;
    static int d[][]=new int[501][501];
    static int map[][]=new int[501][501];
    
    public static void main(String args[]) throws NumberFormatException, IOException
    {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        n=Integer.parseInt(br.readLine());
        
        StringTokenizer st = null;
        
        for(int i = 1 ; i <= n ; i++){
            st = new StringTokenizer(br.readLine());
            int j =1;
            while(st.hasMoreTokens()){
                map[i][j]=Integer.parseInt(st.nextToken());
                j++;
            }
        }
        
        d[1][1]=map[1][1];
        for(int i = 2 ; i <= n ; i++){
            d[i][1]=map[i][1]+d[i-1][1];
            d[i][i]=map[i][i]+d[i-1][i-1];
            for(int j = 2 ; j < i ; j++){
                d[i][j]=map[i][j]+Math.max(d[i-1][j], d[i-1][j-1]);
            }
        }
        
        int max =0;
        for(int i = 1 ; i <= n ; i++){
            if(max <d[n][i]){
                max = d[n][i];
            }
        }
        System.out.println(max);
        
    }
}
 

<C++>

#include <iostream>
using namespace std;
 
int n;
int d[501][501];
int map[501][501];
 
int max(int a, int b) {
    if (a > b) {
        return a;
    }
    return b;
}
 
int main() {
    
    cin >> n;
 
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= i; j++) {
            cin >> map[i][j];
        }
    }
 
    d[1][1] = map[1][1];
 
    for (int i = 1; i <= n; i++) {
        d[i][1] = map[i][1] + d[i - 1][1];
        d[i][i] = map[i][i] + d[i - 1][i - 1];
        for (int j = 2; j < i; j++) {
            d[i][j] = map[i][j] + max(d[i - 1][j - 1], d[i - 1][j]);
        }
    }
 
    int max = 0;
    for (int i = 1; i <= n; i++) {
        if (max < d[n][i]) {
            max = d[n][i];
        }
    }
    cout << max << endl;
 
}