# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
654159 | Farbod | Financial Report (JOI21_financial) | C++17 | 274 ms | 44276 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 <iostream>
#include <vector>
using namespace std;
const int N = 7005;
int n, d, a[N], dp[N], ans = 1;
bool f[N][N];
void fun1()
{
vector <int> v;
for (int i = n - 1; i >= 0; i--) {
while (v.size() && a[v.back()] <= a[i])
v.pop_back();
v.push_back(i);
cerr << v.size() << '\n';
ans = max(ans, (int)v.size());
}
cout << ans;
return;
}
signed main()
{
cin >> n >> d;
# | 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... |