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 MAXN = 2e5 + 25;
int n, x, a[MAXN], dp[MAXN];
int LIS () {
for (int i = 1; i <= n; i++) {
dp[i] = 0;
for (int j = 1; j < i; j++) {
if (a[j] < a[i]) {
dp[i] = max(dp[i], dp[j]);
}
}
dp[i]++;
}
return *max_element(dp + 1, dp + n + 1);
}
void solve () {
cin >> n >> x;
for (int i = 1; i <= n; i++) cin >> a[i];
int mx = 0;
for (int i = -x; i <= x; i++) {
for (int j = 1; j <= n; j++) {
for (int k = 1; k <= j; k++) {
a[k] += i;
}
mx = max(mx, LIS());
for (int k = 1; k <= j; k++) {
a[k] -= i;
}
}
}
cout << mx << '\n';
}
signed main () {
ios::sync_with_stdio(0); cin.tie(0);
int t = 1; //cin >> t;
while (t--) solve();
}
# | 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... |