백준 알고리즘/다이나믹 프로그래밍75 백준 1010번 C++ #include#includeusing namespace std; int m;int site[31][31]; int cal(int w, int e) { if (site[w][e] != 0)return site[w][e]; int a = w - 1;int b = e;while (a > m; memset(site, 0, sizeof(site)); for (int i = 1; i > west >> east;cout > w >> e;cout 2019. 1. 15. 백준 2156번 C++ #include #include using namespace std; int m;int wine[10001];int winecopy[10001]; int binarynum() {winecopy[1] = wine[1];winecopy[2] = wine[1] + wine[2];winecopy[3] = max(winecopy[2], max(wine[1] + wine[3], wine[2] + wine[3])); for (int i = 4; i > m;for (int i = 1; i > wine[i];}cout 2019. 1. 15. 백준 11726번 C++ #include #include using namespace std; int m;int shape[1001]; int binarynum() {shape[1] = 1;shape[2] = 2;for (int i = 3; i > m;cout 2019. 1. 15. 백준 2193번 C++ #include #include using namespace std; int m;long long binary[91]; long long binarynum() {binary[1] = 1;binary[2] = 1;for (int i = 3; i > m;cout 2019. 1. 14. 이전 1 ··· 15 16 17 18 19 다음
