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;
typedef long long ll;
#define fi first
#define se second
ll n,x;
// int lis[200005][200005]; // prev, cur
ll cek(vector<int> x){
ll tmp[n+5];
ll ans=0;
for(int i=n;i>0;i--){
tmp[i]=1;
for(int j=i+1;j<=n;j++){
if(x[j]>x[i]) tmp[i] = max(tmp[j]+1, tmp[i]);
}
ans=max(ans,tmp[i]);
}
return ans;
}
int main(){
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
cin>>n>>x;
vector<int> a(n+1);
ll ans=0;
for(int i=1;i<=n;i++){
cin>>a[i];
}
for(int i=1;i<=n;i++){// pilih segmen
for(int j=i;j<=n;j++){
for(int k=-1*x;k<x;k++){
vector<int> tmp = a;
for(int l=i; l<=j; l++){
tmp[l] += k;
}
ans = max(cek(tmp),ans);
}
}
}
cout<<ans<<'\n';
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... |