알고리즘 문제 풀이/1DP_과제(~180615)
180103_TRIANGLEPATH
//https://algospot.com/judge/problem/read/TRIANGLEPATH#include using namespace std;int dp[101][101];int tri[101][101]; int main(){ int c; cin >> c; for(int t=0; t> n; for(int i=1; i tri[i][j]; dp[1][1]=tri[1][1]; for(int i=1; i
