Submission #713840

#TimeUsernameProblemLanguageResultExecution timeMemory
713840ALTAKEXEBaloni (COCI15_baloni)C++14
100 / 100
339 ms4336 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; const ll N=1e6 + 11; int main() { //freopen("input.txt","r",stdin); ll n; cin >> n; int a[N]; for (int i = 1;i <= n;i++) cin >> a[i]; ll ans = 0; multiset<ll> st; for (int i = 1;i <= n;i++) { auto to = st.find(a[i] + 1); if (to == st.end()) { ans++; } else { st.erase(to); } st.insert(a[i]); } cout << ans; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...