백준 알고리즘/다이나믹 프로그래밍75 백준 2167번 C++ #include#includeusing namespace std; int n, m;int arr[301][301]; int calculatesum(int i, int j, int x, int y) {int sum = 0;for (int b = j; b n >> m; for (int i = 1; i arr[i][j];}}int test_case;cin >> test_case;for (int k = 0; k > i >> j >> x >> y;cout 2019. 1. 17. 백준 11057번 C++ #include#includeusing namespace std; const int DIV = 10007;int n;int ascend[10][1001]; int calascend() {memset(ascend, 0, sizeof(ascend)); for (int i = 0; i 2019. 1. 17. 백준 9461번 C++ #include#includeusing namespace std; int n;long long length[101]; long long trianglelength() {length[1] = length[2] = length[3] =1;length[4] = length[5] = 2; for (int i = 6; i > test_case;for (int i = 0; i > n;cout 2019. 1. 17. 백준 9465번 C++ #include#includeusing namespace std; int n;int sticker[2][100001];int stickercal[2][100001]; int stickercount() {stickercal[0][0] = sticker[0][0];stickercal[1][0] = sticker[1][0];stickercal[0][1] = sticker[1][0] + sticker[0][1];stickercal[1][1] = sticker[0][0] + sticker[1][1]; for (int i = 2; i < n; i++) {stickercal[0][i] = sticker[0][i] + max(stickercal[1][i - 1], stickercal[1][i - 2]);stickerc.. 2019. 1. 17. 이전 1 ··· 14 15 16 17 18 19 다음
