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 ll long long
#define f first
#define s second
#define _ ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int main() {_
int n,x;
cin>>n>>x;
vector<int> num(n);
for(auto &u:num){
cin>>u;
}
int ans=0;
set<int> s;
for(int r=0;r<n;r++){
s.clear();
for(int i=0;i<n;i++){
int temp;
if(i<=r) temp=num[i]-x;
else temp=num[i];
if(s.lower_bound(temp)!=s.end()) s.erase(s.lower_bound(temp));
s.insert(temp);
}
ans=max(ans,(int)(s.size()));
}
cout<<ans;
return 0;
}
//maybe its multiset not set
# | 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... |