1a:I[10086,["6079","static/chunks/363642f4-ca12a5ed7d30075e.js","5653","static/chunks/5653-10777e0e1fc92dce.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","8501","static/chunks/8501-12247bfa9b4a3a0d.js","643","static/chunks/app/codes/%5Bid%5D/page-56c854ce831bc98e.js"],"AdSenseInsert"] 1b:I[48803,["6079","static/chunks/363642f4-ca12a5ed7d30075e.js","5653","static/chunks/5653-10777e0e1fc92dce.js","5000","static/chunks/5000-a7bfe5b9669501e3.js","8501","static/chunks/8501-12247bfa9b4a3a0d.js","643","static/chunks/app/codes/%5Bid%5D/page-56c854ce831bc98e.js"],"CodeViewer"] 1c:T4f7,#include using namespace std; struct brick { int no; int bottom_suface; int height; int weight; }; vector v; vector res; int lis_length[1024]; int backtrack_index[1024]; int num; int i, j; bool comp(brick b1, brick b2) { return b1.bottom_suface > b2.bottom_suface; } int main() { ios::sync_with_stdio(NULL); cin.tie(NULL); cout.tie(NULL); fill(backtrack_index, backtrack_index + 1024, -1); cin >> num; for (i = 0; i < num; i++) { int a, b, c; cin >> a >> b >> c; v.push_back({i + 1, a, b, c}); } sort(v.begin(), v.end(), comp); for (int i = 0; i < num; i++){ lis_length[i] = v[i].height; for (int j = 0; j < i; j++){ if(v[j].weight > v[i].weight && lis_length[j] + v[i].height > lis_length[i]){ lis_length[i] = lis_length[j] + v[i].height; backtrack_index[i] = j; } } } int max_index = max_element(lis_length, lis_length + num) - lis_length; while (max_index != -1) { res.push_back(v[max_index].no); max_index = backtrack_index[max_index]; } cout << res.size() << '\n'; for (auto i: res) cout << i << '\n'; return 0; } 5:["$","div",null,{"className":"container mx-auto px-4","data-sentry-component":"CodePage","data-sentry-source-file":"page.tsx","children":[["$","div",null,{"className":"w-full","children"

코드 #6476