이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
#define int long long
#define ff first
#define ss second
#define pb push_back
#define all(x) x.begin(),x.end()
using namespace std;
signed main(){
ios_base::sync_with_stdio();
cin.tie(0);cout.tie(0);
int n,x;
cin>>n>>x;
vector <int> a(n);
for(int i=0;i<n;i++)cin>>a[i];
int mx=0;
for(int i=0;i<n;i++){
a[i]-=x;
vector <int> v(n+1,1e18);
v[0]=-1e18;
for(int j=0;j<n;j++){
auto it=lower_bound(all(v),a[j]);
int pos=it-v.begin();
v[pos]=a[j];
mx=max(mx,pos);
}
}
cout<<mx<<"\n";
}
/*
4
1 2200 700
1 1800 10
1 2550 9999
1 2000 750
3
1 1500 300
1 1900 1500
1 2400 4550
*/
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |