제출 #1213297

#제출 시각아이디문제언어결과실행 시간메모리
1213297rhm_ganKnapsack (NOI18_knapsack)C++20
0 / 100
26 ms324 KiB
#include <bits/stdc++.h> using namespace std; #ifdef LOCAL #include "debug.h" #else #define dbg(...) 42 #endif int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int n, x; cin >> n >> x; vector<int> a(n); for (int i = 0; i < n; i++) { cin >> a[i]; } auto lis = [&]() { set<int> s; for (auto x : a) { auto it = s.lower_bound(x); if (it != s.end()) { s.erase(it); } s.insert(x); } return (int)s.size(); }; int res = lis(); if (x == 0) { cout << res << '\n'; return 0; } for (int i = 0; i < n; i++) { a[i] -= x; res = max(res, lis()); } cout << res << '\n'; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...