본문 바로가기

백준 알고리즘/다이나믹 프로그래밍75

백준 11054번 C++ #include #include using namespace std; const int MAX = 1001;int n;int arr[MAX];int lisnum[MAX]; int LIS(int k) {for (int i = 0; i arr[j] && lisnum[i] = k; i--) {lisnum[i] = 1;for (int j = n-1; j > i; j--) {if (arr[i] > arr[j] && lisnum[i] < lisnum[j] + 1)lisnum[i] = lisnum[j] + 1;}}return answer + lisnum[k] -.. 2019. 2. 13.
백준 1965번 C++ #include #include using namespace std; const int MAX = 1001;int n;int arr[MAX];int lisnum[MAX]; int LIS() {int maxnum = -1;for (int i = 0; i arr[j] && lisnum[i] > n;for (int i = 0; i > arr[i];}cout 2019. 2. 13.
백준 1520번 C++ #include#include#includeusing namespace std; int m, n;int arr[501][501];int ans[501][501]; bool rangecheck(int x, int y) {return x = 0 && y = 0;} int calway(int x,int y) {pair move[4] = { {1,0},{-1,0},{0,-1},{0,1} }; if (x == m-1 && y == n-1)return 1;int &answer = ans[x][y];if (answer != -1)return answer;answer = 0;for (int i = 0; i < 4; i++) {if (rangecheck((x + move[i].firs.. 2019. 1. 23.
백준 11722번 C++ #include#includeusing namespace std; int arr[1001];int ans[1001];int n; void caldown() {ans[0] = 1;int maxnum; for (int i = 1; i arr[i])maxnum = max(maxnum, ans[j]);}if (maxnum != 0) ans[i] = maxnum + 1;elseans[i] = 1;}maxnum = 0;for (int i = 0; i n; for (int i = 0; i < n; i++) {ci.. 2019. 1. 23.

티스토리툴바