제출 #1313097

#제출 시각아이디문제언어결과실행 시간메모리
1313097boclobanchatMoney (IZhO17_money)C++20
0 / 100
0 ms332 KiB
#include<bits/stdc++.h> using namespace std; const int MAXN=1e6+5; int fen[MAXN],A[MAXN]; void update(int i,int n,int val) { for(;i<=n;i+=i&-i) fen[i]=max(fen[i],val); } int get(int i) { int ans=0;for(;i;i-=i&-i) ans=max(ans,fen[i]);return ans; } int main() { ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n; cin>>n; for(int i=1;i<=n;i++) { cin>>A[i]; A[i]=1e6-A[i]+1; update(A[i],1e6,get(A[i]-1)+1); } cout<<get(1e6); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...