# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
515737 | goodluck2020 | Financial Report (JOI21_financial) | C++14 | 301 ms | 20004 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>
#define task "JOI21_FINANCIAL"
using namespace std;
const int N = 3e5 + 5;
int n, A[N], D;
set < int > Set;
int CP[N], cnt;
void compress()
{
for(int i = 1; i <= n; i++) Set.insert(A[i]);
for(int j : Set) CP[++cnt] = j;
for(int i = 1; i <= n; i++)
A[i] = lower_bound(CP + 1, CP + cnt + 1, A[i]) - CP;
}
namespace sub2
{
int dp[405][405], ans;
void solve()
{
for(int i = 0; i <= n; i++)
for(int j = 0; j <= n; j++) dp[i][j] = -1e9;
dp[0][0] = 0;
for(int i = 0; i < n; i++)
{
if(i)
dp[i][A[i]] = max(dp[i][A[i]], 1);
for(int j = 0; j <= n; j++)
for(int t = i + 1; t <= i + D; t++)
if(t <= n)
dp[t][max(A[t], j)] = max(dp[t][max(A[t], j)], dp[i][j] + (A[t] > j));
}
for(int j = 0; j <= n; j++) ans = max(ans, dp[n][j]);
cout << ans;
}
}
namespace sub4
{
int L[N], St[N], top, ans;
priority_queue < int > pq;
void solve()
{
for(int i = 1; i <= n; i++)
{
while(top && A[i] > A[St[top]]) top--;
L[i] = St[top] + 1;
St[++top] = i;
}
for(int i = n; i >= 1; i--)
{
pq.push(L[i]);
while(pq.top() > i) pq.pop();
ans = max(ans, (int)pq.size());
}
cout << ans;
}
}
int main()
{
if(fopen(task ".inp","r"))
{
freopen(task ".inp","r",stdin);
freopen(task ".out","w",stdout);
}
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
cin >> n >> D;
for(int i = 1; i <= n; i++) cin >> A[i];
compress();
if(n <= 400) sub2::solve();
else if(D == 1) sub4::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... |