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 int long long
int n, x, t[200005], ans = 0;
void solve(int l, int r, int s) {
// cout << l << " " << r << " " << s << endl;
for (int i = l; i <= r; i++) {
t[i] += s;
}
stack<int> st;
int temp;
for (int i = 1; i <= n; i++) {
while (!st.empty()) {
if (t[i] <= st.top()) st.pop();
else break;
}
st.push(t[i]);
temp = st.size();
// cout << " " << temp << endl;
ans = max(temp, ans);
}
for (int i = l; i <= r; i++) {
t[i] -= s;
}
}
signed main() {
cin >> n >> x;
for (int i = 1; i <= n; i++) cin >> t[i];
for (int l = 1; l <= n; l++) {
for (int r = l; r <= n; r++) {
for (int s = -x; s <= x; s++) {
solve(l, r, s);
}
}
}
cout << ans << endl;
}
# | 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... |