# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
412901 | aris12345678 | Maxcomp (info1cup18_maxcomp) | C++14 | 3 ms | 308 KiB |
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 mxN = 1e3+5;
int a[mxN];
int main() {
int n, m;
scanf("%d %d", &n, &m);
for(int i = 0; i < m; i++)
scanf("%d", &a[i]);
int ans = 0;
for(int i = 0; i < m; i++) {
int mx = 0, mn = INT_MAX;
for(int j = i; j < m; j++) {
mx = max(mx, a[j]);
mn = min(mn, a[j]);
ans = max(ans, mx-mn-(j-i+1));
}
}
printf("%d\n", ans);
return 0;
}
Compilation message (stderr)
# | 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... |