제출 #710277

#제출 시각아이디문제언어결과실행 시간메모리
710277zyq_Money (IZhO17_money)C++17
0 / 100
1 ms320 KiB
#include <bits/stdc++.h> using namespace std; #define int long long int N, inp; vector<int> v; vector<int> cur; set<int> s; int ans; int32_t main() { ios::sync_with_stdio(0); cin >> N; for(int a=0; a<N; a++){ cin >> inp; v.push_back(inp); if(a == 0){ cur.push_back(inp); continue; } if(inp < cur.back()){ ans++; while(!cur.empty()){ s.insert(cur.back()); cur.pop_back(); } cur.push_back(inp); continue; } //check if there is num if(s.lower_bound(inp) != s.upper_bound(cur.back())){ ans++; while(!cur.empty()){ s.insert(cur.back()); cur.pop_back(); } cur.push_back(inp); continue; } cur.push_back(inp); } cout << ans+1; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...