제출 #1052050

#제출 시각아이디문제언어결과실행 시간메모리
1052050SacharlemagneFinancial Report (JOI21_financial)C++17
0 / 100
73 ms1372 KiB
#include <bits/stdc++.h> using namespace std; int main() { int n,d; cin >> n >> d; vector<int> v(n); for (int &i : v) cin >> i; vector<int> dp; // dp[i] = minimum ending of lis size i for (int i : dp) { auto pt = upper_bound(dp.begin(), dp.end(), i); if (pt == dp.end()) dp.push_back(i); *pt = i; } cout << dp.size(); }
#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...
#Verdict Execution timeMemoryGrader output
Fetching results...