알고리즘 문제 풀이/1DP_과제(~180615)
180331_12100_2048(easy)
//https://www.acmicpc.net/problem/12100 #include using namespace std;#define UP 0#define DOWN 1#define LEFT 2#define RIGHT 3int mx=0;int N;int board[20][20][2];int cache[6][20][20];void solve(int dir, int depth); int main(){ cin >> N; for(int i=0; i board[i][j][0]; cache[0][i][j]=board[i][j][0]; } for(int i=0; i
