제출 #109149

#제출 시각아이디문제언어결과실행 시간메모리
109149bibabasMoney (IZhO17_money)C++14
0 / 100
2 ms384 KiB
#ifdef LOCAL #define _GLIBCXX_DEBUG #endif #include <bits/stdc++.h> #define ll long long #define vi vector<int> #define vvi vector<vi> #define all(x) x.begin(), x.end() #define pb push_back #define mp make_pair int INF = (int)2e9; using namespace std; template <class T> istream& operator >>(istream &in, vector<T> &arr) { for (T &cnt : arr) { in >> cnt; } return in; }; void solve() { int n; cin >> n; vi a(n); cin >> a; vi d(n + 1, INF); d[0] = -INF; for (int i = 0; i < n; ++i){ int j = upper_bound(d.begin(), d.end(), a[i]) - d.begin(); if (d[j - 1] < a[i] && d[j] > a[i]) d[j] = a[i]; } cout << n - (lower_bound(d.begin(), d.end(), INF) - d.begin()) + 1; } int main() { #ifdef LOCAL freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout); #else ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); #endif solve(); 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...