# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
696815 | tamthegod | Financial Report (JOI21_financial) | C++17 | 4050 ms | 6332 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.
// Make the best become better
// No room for laziness
#include<bits/stdc++.h>
#define int long long
#define pb push_back
#define fi first
#define se second
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int maxN = 1e6 + 5;
const int mod = 1e9 + 7;
const ll oo = 1e18;
int n, d;
int a[maxN];
int t[maxN];
int f[maxN];
void ReadInput()
{
cin >> n >> d;
for(int i=1; i<=n; i++)
cin >> a[i];
}
void Solve()
{
for(int i=1; i<=n; i++)
{
int j = i + 1;
int cnt = 0;
t[i] = n;
for(int j=i+1; j<=n; j++)
{
if(a[j] <= a[i]) cnt = 0;
else cnt++;
if(cnt == d)
{
t[i] = j;
break;
}
}
}
// cout << t[1];return;
for(int i=1; i<=n; i++)
{
f[i] = 1;
for(int j=1; j<i; j++)
{
if(a[i] > a[j] && t[j] >= i) f[i] = max(f[i], f[j] + 1);
}
}
cout << *max_element(f + 1, f + n + 1);
}
int32_t main()
{
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
ReadInput();
Solve();
}
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... |