제출 #640098

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
640098		Karliver	Financial Report (JOI21_financial)	C++17	28 / 100	4062 ms	1048576 KiB

Main

	
#include <bits/stdc++.h>

#define FIXED_FLOAT(x)  std::fixed <<std::setprecision(20) << (x)
#define all(v) (v).begin(), (v).end()
using namespace  std;
#define forn(i,n) for (int i = 0; i < (n); ++i)
#define rforn(i, n) for(int i = (n) - 1;i >= 0;--i)
#define sz(x) (int)x.size()
#define ff first
#define se second
#define mp make_pair
using ll = long long;
int MOD = 998244353;
const int inf = 1e9 + 1;
const int N = 2e5 + 10;

const double eps = 1e-7;

template <class T> using V = vector<T>;  
template <class T> using VV = V<V<T>>;  
template<class T, size_t SZ> using AR = array<T, SZ>;
template<class T> using PR = pair<T, T>;
template <typename XPAX>
bool ckma(XPAX &x, XPAX y) {
	return (x < y ? x = y, 1 : 0);
}
template <typename XPAX>
bool ckmi(XPAX &x, XPAX y) {
	return (x > y ? x = y, 1 : 0);
}



void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)


void solve() {

	
	
	
	int n;
	cin >> n;
	int D;
	cin >> D;
	V<int> a(n);
	forn(i, n) cin >> a[i];
	
	VV<int> dp(n + 1, V<int>(n + 3, inf));
	
	forn(i, n) dp[i][1] = a[i];
	int res = 0;
	forn(j, n) {
		forn(d, n+1) {
			if(dp[j][d] == inf)continue;
			for(int k = j+1;k < min(n, j+D+1);++k) ckmi(dp[k][d+(dp[j][d]<a[k])], max(dp[j][d], a[k]));
			ckma(res, d);
		}
	}
	cout  << res << '\n';
	
	
	
	
	
}
void test_case() {
	int t;
	cin >> t;
	forn(p, t) {

		//cout << "Case #" << p + 1 << ": ";
		solve();
	}
}
int main() {

	ios::sync_with_stdio(false);
	cin.tie(0);

	solve();

}

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