Submission #98755

#TimeUsernameProblemLanguageResultExecution timeMemory
98755M_H_H_7Baloni (COCI15_baloni)C++14
0 / 100
101 ms18720 KiB
//In The Name of Beauty #include <bits/stdc++.h> using namespace std; typedef long long ll; typedef vector<ll> vll; #define IB std::ios::sync_with_stdio(0); #define pb(x) push_back(x); #define mp(x,y) make_pair(x,y) #define pll pair<ll,ll> #define F first #define S second ll const MAXN = 1e6 + 8; ll const INF = 1e12 + 8; ll const delta = 1000000007; ll a[MAXN]; ll last[MAXN]; int main() { IB; cin.tie(0); cout.tie(0); ll n; cin >> n; for(ll i = 0;i < MAXN;i++)last[i] = -1; for(ll i = 1;i <= n;i++)cin >> a[i]; ll ans = 0; for(ll i = n;i >= 1;i--) { ll t = a[i]; last[t] = i; if(last[t - 1] == -1)ans++; } cout << ans; return 0; } //Written by M_H_H_7
#Verdict Execution timeMemoryGrader output
Fetching results...