# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
557104 | donaldchuity | Financial Report (JOI21_financial) | C++17 | 4094 ms | 1364 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;
int main() {
int n, d; cin >> n >> d;
int a[n]; for (int i = 0; i < n; i++) cin >> a[i];
int maxcount = 0;
int maxi = -1;
for (int i = 0; i < n-2; i++) {
int maxi = a[i];
int count = 1;
for (int j = i+1; j < n-1; j++) {
if (a[j] > maxi) {
count++;
maxi = a[j+1];
}
}
maxcount = max(maxcount, count);
}
cout << maxcount << endl;
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |