[Week02] 줄서는방법, 상자넣기, 퇴사2

weekly/week02/BOJ_15486_퇴사2/gyuhyeok99.cpp

@@ -0,0 +1,31 @@
+#include <iostream>
+#include <algorithm>
+
+using namespace std;
+
+int n, ret;
+int arr[1500001][2];
+int dp[1500001];
+
+int main() {
+    ios_base::sync_with_stdio(false);
+    cin.tie(NULL);
+    cout.tie(NULL);
+
+    cin >> n;
+
+    for (int i = 0; i < n; i++) {
+        cin >> arr[i][0] >> arr[i][1];
+    }
+
+    for (int i = n - 1; i >= 0; i--) {
+        if (i + arr[i][0] <= n) {
+            dp[i] = max(dp[i + 1], arr[i][1] + dp[i + arr[i][0]]);
+        } else {
+            dp[i] = dp[i + 1];
+        }
+    }
+
+    cout << dp[0] << '\n';
+    return 0;
+}

weekly/week02/BOJ_1965_상자넣기/gyuhyeok99.cpp

@@ -0,0 +1,26 @@
+#include <iostream>
+#include <algorithm>
+
+using namespace std;
+
+int n, len, num;
+int lis[1001];
+int main() {
+    ios_base::sync_with_stdio(false);
+    cin.tie(NULL);
+    cout.tie(NULL);
+
+    cin >> n;
+
+    for (int i = 0; i < n; i++) {
+        cin >> num;
+        auto lowerPos = lower_bound(lis, lis + len, num);
+        if (*lowerPos == 0) {
+            len++;
+        }
+        *lowerPos = num;
+    }
+
+    cout << len << '\n';
+    return 0;
+}

weekly/week02/PGS_줄서는방법/gyuhyeok99.cpp

@@ -0,0 +1,30 @@
+#include <string>
+#include <vector>
+using namespace std;
+
+vector<int> answer;
+vector<int> numbers;
+vector<long long> dp;
+
+vector<int> solution(int n, long long k) {
+    dp.resize(n);
+    dp[0] = 1;
+    for (int i = 1; i < n; i++) {
+        dp[i] = dp[i-1] * i;
+    }
+
+    for (int i = 1; i <= n; i++) {
+        numbers.push_back(i);
+    }
+
+    k--;
+
+    for (int i = 0; i < n; i++) {
+        long long idx = k / dp[n-1-i];
+        answer.push_back(numbers[idx]);
+        numbers.erase(numbers.begin() + idx);
+        k %= dp[n-1-i];
+    }
+
+    return answer;
+}