제출 #582381

#제출 시각아이디문제언어결과실행 시간메모리
582381Mr_HusanboyGlobal Warming (CEOI18_glo)C++14
10 / 100
62 ms7684 KiB
// Muallif: Mansuraliyev Husanboy Murotali o'g'li >> NamPS #pragma GCC optimize("Ofast") #include<bits/stdc++.h> using namespace std; #define ll long long #define ull unsigned long long #define ios ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL) #define all(a) a.begin(), a.end() #define F first #define S second #define fp(a,i,c) for(int (a) = (i); (a) < (c); (a)++) #define fm(a,i,c) for(int (a) = (i); (a) >= (c); (a)--) #define vii vector<int> #define vll vector<ll> // 0-9 >> 48-57; A-Z>>65-90 and a-z>>97-122 respectively; void solve(){ int n; ll x; cin>>n>>x; ll a[n]; for(int i=0;i<n;i++) cin>>a[i]; set<int> st; set<int>::iterator it; st.clear(); for(int i=0; i<n; i++) { it = st.lower_bound(a[i]); if (it != st.end()) st.erase(it); st.insert(a[i]); } cout<<st.size()<<endl; // for(auto u:st) cout<<u<<" "; } int main(){ ios; // int t; cin>>t; while(t--) solve(); }
#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...