# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1147764 | guagua0407 | Financial Report (JOI21_financial) | C++20 | 4094 ms | 28752 KiB |
//#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int,int>
#define f first
#define s second
#define all(x) x.begin(),x.end()
#define _ ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int dx[4]={0,0,1,-1};
int dy[4]={1,-1,0,0};
void setIO(string s) {
freopen((s + ".in").c_str(), "r", stdin);
freopen((s + ".out").c_str(), "w", stdout);
}
const int inf=1e9;
const int mxn=3e5+5;
int mn[mxn][20];
int main() {_
int n,d;
cin>>n>>d;
vector<int> a(n+1);
for(int i=1;i<=n;i++){
cin>>a[i];
}
vector<int> xs;
xs.push_back(-1);
for(int i=1;i<=n;i++){
xs.push_back(a[i]);
}
sort(all(xs));
xs.resize(unique(all(xs))-xs.begin());
for(int i=1;i<=n;i++){
a[i]=lower_bound(all(xs),a[i])-xs.begin();
}
for(int i=1;i<=n;i++){
mn[i][0]=a[i];
}
for(int j=1;j<20;j++){
for(int i=1;i+(1<<j)-1<=n;i++){
mn[i][j]=min(mn[i][j-1],mn[i+(1<<(j-1))][j-1]);
}
}
vector<int> dp(n+1);
vector<int> curmx(n+1);
for(int i=1;i<=n;i++){
for(int j=0;j<a[i];j++){
dp[i]=max(dp[i],curmx[j]+1);
}
if(i>=d){
int curmn=*min_element(a.begin()+i-d+1,a.begin()+i+1);
for(int j=0;j<curmn;j++){
curmx[j]=0;
}
}
curmx[a[i]]=max(curmx[a[i]],dp[i]);
}
cout<<*max_element(all(dp))<<'\n';
return 0;
}
//maybe its multiset not set
//yeeorz
//diaoborz
컴파일 시 표준 에러 (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... |