{"id":27545,"date":"2024-10-27T14:41:46","date_gmt":"2024-10-27T14:41:46","guid":{"rendered":"http:\/\/atmokpo.com\/w\/?p=27545"},"modified":"2024-11-26T07:17:26","modified_gmt":"2024-11-26T07:17:26","slug":"c-%ec%bd%94%eb%94%a9%ed%85%8c%ec%8a%a4%ed%8a%b8-%ea%b0%95%ec%a2%8c-%ea%b0%80%ec%9e%a5-%ea%b8%b8%ea%b2%8c-%ec%a6%9d%ea%b0%80%ed%95%98%eb%8a%94-%eb%b6%80%eb%b6%84-%ec%88%98%ec%97%b4-%ec%b0%be","status":"publish","type":"post","link":"https:\/\/atmokpo.com\/w\/27545\/","title":{"rendered":"C++ \ucf54\ub529\ud14c\uc2a4\ud2b8 \uac15\uc88c, \uac00\uc7a5 \uae38\uac8c \uc99d\uac00\ud558\ub294 \ubd80\ubd84 \uc218\uc5f4 \ucc3e\uae30"},"content":{"rendered":"

<\/p>\n

\ubb38\uc81c \uc124\uba85<\/h2>\n

\n \uc8fc\uc5b4\uc9c4 \uc815\uc218 \ubc30\uc5f4\uc5d0\uc11c \uac00\uc7a5 \uae38\uac8c \uc99d\uac00\ud558\ub294 \ubd80\ubd84 \uc218\uc5f4(Longest Increasing Subsequence, LIS)\uc744 \ucc3e\uc544\uc57c \ud569\ub2c8\ub2e4.
\n \ubd80\ubd84 \uc218\uc5f4\uc740 \uc6d0\ubcf8 \ubc30\uc5f4\uc5d0\uc11c \uc694\uc18c\uc758 \uc21c\uc11c\ub97c \uc720\uc9c0\ud558\uba70 \uc120\ud0dd\ub41c \uc694\uc18c\ub4e4\ub85c \uad6c\uc131\ub429\ub2c8\ub2e4.
\n \uc774 \ubb38\uc81c\ub294 \ub3d9\uc801 \ud504\ub85c\uadf8\ub798\ubc0d(Dynamic Programming) \ub610\ub294 \uc774\ubd84 \ud0d0\uc0c9(Binary Search)\uc744 \ud1b5\ud574 \ud574\uacb0\ud560 \uc218 \uc788\uc2b5\ub2c8\ub2e4.\n <\/p>\n

\uc608\uc2dc<\/h2>\n

\n\uc785\ub825:<\/strong> [10, 9, 2, 5, 3, 7, 101, 18]<\/code>
\n\ucd9c\ub825:<\/strong> 4<\/code> (\uac00\uc7a5 \uae34 \uc99d\uac00\ud558\ub294 \ubd80\ubd84 \uc218\uc5f4: [2, 3, 7, 101])\n <\/p>\n

\ubb38\uc81c \uc811\uadfc \ubc29\ubc95<\/h2>\n

\n \uc774 \ubb38\uc81c\ub97c \ud574\uacb0\ud558\uae30 \uc704\ud55c \ubc29\ubc95\uc740 \uc5ec\ub7ec \uac00\uc9c0\uac00 \uc788\uc2b5\ub2c8\ub2e4. \uac00\uc7a5 \ub300\ud45c\uc801\uc778 \ubc29\ubc95\uc740 \ub3d9\uc801 \ud504\ub85c\uadf8\ub798\ubc0d\uc744 \uc0ac\uc6a9\ud558\ub294 \uac83\uc774\uba70,
\n \uc774 \ubc29\ubc95\uc740 O(N^2)\uc758 \uc2dc\uac04 \ubcf5\uc7a1\ub3c4\ub97c \uac00\uc9d1\ub2c8\ub2e4. \uadf8\ub7ec\ub098 \uc774 \ubb38\uc81c\ub294 \uc774\ubd84 \ud0d0\uc0c9\uc744 \uc774\uc6a9\ud558\uc5ec O(N log N)\uc758 \uc2dc\uac04 \ubcf5\uc7a1\ub3c4\ub85c\ub3c4 \ud574\uacb0\ud560 \uc218 \uc788\uc2b5\ub2c8\ub2e4.\n <\/p>\n

1. \ub3d9\uc801 \ud504\ub85c\uadf8\ub798\ubc0d(Dynamic Programming) \uc811\uadfc\ubc95<\/h3>\n

\n \ub3d9\uc801 \ud504\ub85c\uadf8\ub798\ubc0d \uc811\uadfc\ubc95\uc758 \ud575\uc2ec\uc740 ‘\uc911\uac04 \uacb0\uacfc’\ub97c \uc800\uc7a5\ud558\uc5ec, \ub3d9\uc77c\ud55c \uacc4\uc0b0\uc744 \ubc18\ubcf5\ud558\uc9c0 \uc54a\ub3c4\ub85d \ud558\ub294 \uac83\uc785\ub2c8\ub2e4.
\n \ub2e4\uc74c\uacfc \uac19\uc740 \ub2e8\uacc4\ub85c \uc9c4\ud589\ud569\ub2c8\ub2e4.\n <\/p>\n

    \n
  1. \uae38\uc774\ub97c \uc800\uc7a5\ud558\uae30 \uc704\ud55c dp \ubc30\uc5f4\uc744 \ucd08\uae30\ud654\ud569\ub2c8\ub2e4. dp[i]\ub294 i\ubc88\uc9f8 \uc778\ub371\uc2a4\uc758 \uc6d0\uc18c\ub97c \ub05d\uc73c\ub85c \ud558\ub294
    \n \uc99d\uac00\ud558\ub294 \ubd80\ubd84 \uc218\uc5f4\uc758 \ucd5c\ub300 \uae38\uc774\ub97c \uc800\uc7a5\ud569\ub2c8\ub2e4.<\/li>\n
  2. \uc774\uc911 \ubc18\ubcf5\ubb38\uc744 \ud1b5\ud574 \uac01 \uc6d0\uc18c\ub97c \ube44\uad50\ud558\uace0, dp \ubc30\uc5f4\uc744 \uc5c5\ub370\uc774\ud2b8\ud569\ub2c8\ub2e4.
    \n i\ubc88\uc9f8 \uc6d0\uc18c\uac00 j\ubc88\uc9f8 \uc6d0\uc18c\ubcf4\ub2e4 \ud074 \uacbd\uc6b0, dp[i]\ub97c max(dp[i], dp[j] + 1)\ub85c \uc124\uc815\ud569\ub2c8\ub2e4.<\/li>\n
  3. \ucd5c\uc885\uc801\uc73c\ub85c dp \ubc30\uc5f4\uc758 \ucd5c\ub300 \uac12\uc744 \ucc3e\uc544 \ucd9c\ub825\ud569\ub2c8\ub2e4.<\/li>\n<\/ol>\n

    \ucf54\ub4dc (\ub3d9\uc801 \ud504\ub85c\uadf8\ub798\ubc0d)<\/h3>\n
    \n#include <iostream>\n#include <vector>\n#include <algorithm>\nusing namespace std;\n\nint lengthOfLIS(vector& nums) {\n    if (nums.empty()) return 0;\n    vector dp(nums.size(), 1);\n    \n    for (int i = 1; i < nums.size(); i++) {\n        for (int j = 0; j < i; j++) {\n            if (nums[i] > nums[j]) {\n                dp[i] = max(dp[i], dp[j] + 1);\n            }\n        }\n    }\n    return *max_element(dp.begin(), dp.end());\n}\n\nint main() {\n    vector nums = {10, 9, 2, 5, 3, 7, 101, 18};\n    cout << \"\uac00\uc7a5 \uae38\uac8c \uc99d\uac00\ud558\ub294 \ubd80\ubd84 \uc218\uc5f4\uc758 \uae38\uc774: \" << lengthOfLIS(nums) << endl;\n    return 0;\n}\n    <\/int><\/int><\/int><\/code><\/pre>\n
    2. \uc774\ubd84 \ud0d0\uc0c9(Binary Search) \uc811\uadfc\ubc95<\/h3>\n
    \n        \uc774 \ubc29\ubc95\uc740 \ub354 \ud6a8\uc728\uc801\uc774\uba70, O(N log N)\uc758 \uc2dc\uac04 \ubcf5\uc7a1\ub3c4\ub97c \uac00\uc9d1\ub2c8\ub2e4. \uc774 \ubc29\ubc95\uc758 \uae30\ubcf8 \uc544\uc774\ub514\uc5b4\ub294
    \n        ‘\ubd80\ubd84 \uc218\uc5f4\uc758 \ub05d \uc694\uc18c\ub4e4\uc744 \uc800\uc7a5\ud558\ub294 \ubc30\uc5f4’\uc744 \uc720\uc9c0\ud558\ub294 \uac83\uc785\ub2c8\ub2e4.\n    <\/p>\n
      \n
    1. \uacb0\uacfc\ub97c \uc800\uc7a5\ud560 \ubc30\uc5f4\uc744 \ucd08\uae30\ud654\ud569\ub2c8\ub2e4.<\/li>\n
    2. \uac01 \uc6d0\uc18c\uc5d0 \ub300\ud574 \ub2e4\uc74c\uc744 \uc218\ud589\ud569\ub2c8\ub2e4:\n