# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1271584 | KALARRY | Financial Report (JOI21_financial) | C++20 | 4094 ms | 2052 KiB |
//chockolateman
#include<bits/stdc++.h>
using namespace std;
const int INF = 1e9;
int N,D,a[300005],dp[300005],max_reach[300005];
map<int,int> prv_emf;
int main()
{
scanf("%d%d",&N,&D);
for(int i = 1 ; i <= N ; i++)
{
scanf("%d",&a[i]);
a[i]++;
}
for(int i = 1 ; i <= N ; i++)
{
int r = i;
int l = i;
max_reach[i] = i;
while(r - l + 1 <= D && l > 1)
{
l--;
max_reach[i] = l;
if(a[l] <= a[i])
r = l;
}
}
a[0] = 0;
int ans = 0;
for(int i = 1 ; i <= N ; i++)
{
dp[i] = 1;
for(int l = max_reach[i] ; l < i ; l++)
if(a[l] < a[i])
dp[i] = max(dp[i],dp[l] + 1);
ans = max(ans,dp[i]);
}
printf("%d\n",ans);
return 0;
}
컴파일 시 표준 에러 (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... |