알고리즘 문제 풀이/1DP_과제(~180615)
180126_2616_소형기관차
//https://www.acmicpc.net/problem/2616#include #include using namespace std;int dp[4][50001];int train[50001]; int main(){ int n,m; cin >> n; for(int i=1; i> x; train[i]=train[i-1]+x; } cin >> m; for(int i=1*m; i
