Submission #887435

#TimeUsernameProblemLanguageResultExecution timeMemory
8874358pete8Money (IZhO17_money)C++17
0 / 100
1 ms2396 KiB
#include<iostream> #include<stack> #include<map> #include<vector> #include<string> #include<unordered_map> #include <queue> #include<cstring> #include<limits.h> #include <cassert> #include<cmath> #include<set> #include<algorithm> #include <iomanip> #include<numeric> //gcd(a,b) #include<bitset> using namespace std; #define ll long long #define f first #define endl "\n" //#define s second #define pii pair<int,int> #define ppii pair<int,pii> #define vi vector<int> #define pb push_back #define all(x) x.begin(),x.end() #define rall(x) x.rbegin(),x.rend() #define F(n) for(int i=0;i<n;i++) #define lb lower_bound #define ub upper_bound #define fastio ios::sync_with_stdio(false);cin.tie(NULL); #pragma GCC optimize ("03,unroll-loops") using namespace std; #define int long long #define double long double const int mod=1e9+7,mxn=1e6+5,lg=20,inf=1e18; set<int>s; int val[mxn+10],cnt[mxn+10]; int32_t main(){ fastio int n;cin>>n; int ans=0; for(int i=1;i<=n;i++)cin>>val[i]; s.insert(inf); bool yes=false; for(int i=1;i<=n;i++){ auto it=s.lb(val[i]); while(i<=n&&val[i]<=(*it)&&val[i]>val[i-1]){ s.insert(val[i]); i++; } ans++; } cout<<ans; }

Compilation message (stderr)

money.cpp: In function 'int32_t main()':
money.cpp:45:10: warning: unused variable 'yes' [-Wunused-variable]
   45 |     bool yes=false;
      |          ^~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...