알고리즘 문제 풀이/1DP_과제(~180615)
1710221_2302_극장좌석
#include using namespace std; int main(){ int N, M; cin >> N >> M; int vip[41]={0}; int dp[41]={0}; int ans=1; for(int i=1; i> vip[i]; dp[0]=1; dp[1]=1; dp[2]=2; for(int i=3; i
