# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
654184 | Mohammad_Parsa | Financial Report (JOI21_financial) | C++14 | 67 ms | 3964 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
//#define int long long
#define ll long long
#define F first
#define S second
#define pb push_back
const int N=3e5+7;
int dp[N],v[N],a[N];
map<int,int> mp;
vector<int> vec;
int main(){
ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
int n,d;
cin>>n>>d;
for(int i=0;i<n;i++){
cin>>a[i];vec.pb(a[i]);
}
sort(vec.begin(),vec.end());
vec.resize(distance(vec.begin(),unique(vec.begin(),vec.end())));
for(int i=0;i<vec.size();i++){
v[i]=vec[i];
mp[vec[i]]=i;
}
int ans=1;
dp[1]=a[0];
for(int i=1;i<n;i++){
int l=1,r=ans+1;
while(r-l>1){
int m=(l+r)/2;
if(dp[m]>=a[i]) r=m;
else l=m;
}
dp[l+1]=min(dp[l+1],a[i]);
if(l==ans) ans++;
}
cout<<ans;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |