Submission #1237699

#TimeUsernameProblemLanguageResultExecution timeMemory
1237699fauntleroyGlobal Warming (CEOI18_glo)C++20
10 / 100
21 ms3008 KiB
#include <iostream> #include <cstdio> #include <vector> #include <array> #include <string> #include <algorithm> #include <numeric> #include <map> #include <unordered_map> #include <set> #include <unordered_set> #include <queue> #include <cmath> #include <climits> #include <iomanip> #include <limits> #include <tuple> #include <stack> #include <bitset> #include <cstring> #include <sstream> #include <functional> #include <random> #define int long long using namespace std; void solve() { int n, x; cin >> n >> x; vector<int> a(n); for (auto& e : a) cin >> e; vector<int> t; for (auto& e : a) { auto it = lower_bound(t.begin(), t.end(), e); if (it == t.end()) t.push_back(e); else *it = e; } cout << t.size() << '\n'; } signed main() { ios::sync_with_stdio(false); cin.tie(nullptr); 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...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...