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;
const int N = 2e5 + 10;
typedef long long int ll;
#define pb push_back
int n, ans = 0;
ll arr[N], x;
int main(){
cin.tie(0); ios::sync_with_stdio(0);
cin >> n >> x;
for(int i = 1; i <= n; i++) cin >> arr[i];
for(int i = 1; i <= n + 1; i++){
for(int j = i ; j <= n; j++) arr[j] += x;
vector<int> lis(1, 0);
for(int j = 1; j <= n; j++){
int pos = lower_bound(lis.begin(), lis.end(), arr[j]) - lis.begin();
if(pos == int(lis.size())) lis.pb(arr[j]);
else lis[pos] = arr[j];
}
ans = max(ans, int(lis.size()) - 1);
for(int j = i; j <= n; j++) arr[j] -= x;
}
cout << ans;
return 0;
}
# | 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... |