제출 #1187262

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1187262		thelegendary08	Financial Report (JOI21_financial)	C++17	48 / 100	4096 ms	149368 KiB

Main

#include<bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define int long long
#define vi vector<int>
#define vvi vector<vector<int>>
#define pii pair<int, int>
#define vpii vector<pair<int, int>>
#define vc vector<char>
#define vb vector<bool>
#define mii map<int,int>
#define f0r(i,n) for(int i=0;i<n;i++)
#define FOR(i,k,n) for(int i=k;i<n;i++)
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define in(a) int a; cin>>a
#define in2(a,b) int a,b; cin>>a>>b
#define in3(a,b,c) int a,b,c; cin>>a>>b>>c
#define in4(a,b,c,d) int a,b,c,d; cin>>a>>b>>c>>d
#define vin(v,n); vi v(n); f0r(i,n){cin>>v[i];}
#define out(a) cout<<a<<'\n'
#define out2(a,b) cout<<a<<' '<<b<<'\n'
#define out3(a,b,c) cout<<a<<' '<<b<<' '<<c<<'\n'
#define out4(a,b,c,d) cout<<a<<' '<<b<<' '<<c<<' '<<d<<'\n'
#define pout(a) cout<<a.first<<' '<<a.second<<'\n'
#define vout(v) for(auto u : v){cout<<u<<' ';} cout<<'\n'
#define dout(a) cout<<a<<' '<<#a<<'\n'
#define dout2(a,b) cout<<a<<' '<<#a<<' '<<b<<' '<<#b<<'\n'
#define yn(x); if(x){cout<<"YES"<<'\n';}else{cout<<"NO"<<'\n';}
const int leg = 1e9 + 7;
const int mod = 998244353;
using namespace std;
 
signed main(){
	ios::sync_with_stdio(false);
	cin.tie(NULL);
	//ifstream cin(".in");
	//ofstream cout(".out");
	in2(n,d);
	vin(v,n);
	
	vvi adj(n);
	f0r(i,n){
		vb step(n);
		FOR(j, i+1, n){
			if(v[j] <= v[i]){
				step[j] = 1;
			}
		}
		vb ok(n);
		FOR(j, i+1, min(i+d+1,n)){
			if(v[j] > v[i])ok[j] = 1;
		}
		vb rs(n);
		int lst = i;
		FOR(j, i + 1, n){
			if(v[j] <= v[i] && j - lst <= d){
				rs[j] = 1;
				lst = j;
			}
		}
		
		vi ps(n+1);
		FOR(j, 1, n+1)ps[j] = ps[j-1] + rs[j-1];
		
		FOR(j, i+d+1, n){
			if(v[j] > v[i] && ps[j] - ps[j-d] > 0){
				ok[j] = 1;
			}
		}
		f0r(j,n){
			if(ok[j]){
				adj[i].pb(j);
			}
		}
		
	}
	/*
	f0r(i,n){
		cout<<"adj["<<i<<"]: ";
		vout(adj[i]);
	}
	*/
	vi dp(n,1);
	f0r(i,n){
		for(auto u : adj[i]){
			dp[u] = max(dp[u], dp[i] + 1);
		}
	}
	out(*max_element(all(dp)));
}

• Subtask 1: 14 / 14
• Subtask 2: 14 / 14
• Subtask 3: 20 / 20
• Subtask 4: 0 / 12
• Subtask 5: 0 / 5
• Subtask 6: 0 / 35