Submission #1264519

#	Time	Username	Problem	Language	Result	Execution time	Memory
1264519		tminh	Financial Report (JOI21_financial)	C++20	100 / 100	279 ms	77400 KiB

Main

#include "bits/stdc++.h"
using namespace std;

#define task ""
#define ll long long
#define endl '\n'
#define fi first
#define se second
#define vall(a) (a).begin(), (a).end()
#define sze(a) (int)a.size()
#define pii pair<int, int>
#define pll pair<ll, ll>


#define ep emplace_back
#define pb push_back
#define pf push_front


const ll mod = 1e9 + 7;
const int N = 5e5 + 5;
const ll oo = 1e18;

bool START;

int n, d, a[N], w[N], far[N];

struct ST {
	int st[N << 2];
	void update(int id, int l, int r, int i, int val) {
		if (l > i || r < i) return;
		if (l == r) {
			st[id] = max(st[id], val);
			return;
		}
		int mid = (l + r) >> 1;
		update(id << 1, l, mid, i, val);
		update(id << 1 | 1, mid + 1, r, i, val);
		st[id] = max(st[id << 1], st[id << 1 | 1]);
	}
	int get(int id, int l, int r, int u, int v) {
		if (l > v || r < u) return 0;
		if (l >= u && r <= v) return st[id];
		int mid = (l + r) >> 1;
		return max(get(id << 1, l, mid, u, v), get(id << 1 | 1, mid + 1, r, u, v));
	}
} st;


struct rmqmin {
	int st[N][19];
	void build() {
		for (int i = 1; i <= n; ++i) st[i][0] = a[i];
		for (int i = 1; (1 << i) <= n; ++i) {
			for (int j = 1; j + (1 << i) - 1 <= n; ++j) {
				st[j][i] = min(st[j][i - 1], st[j + (1 << (i - 1))][i - 1]);
			}
		}
	}
	int get(int l, int r) {
		int k = __lg(r - l + 1);
		return min(st[l][k], st[r - (1 << k) + 1][k]);
	}
} stmin;

struct rmqmax {
	int st[N][19];
	void build() {
		for (int i = 1; i <= n; ++i) st[i][0] = w[i];
		for (int i = 1; (1 << i) <= n; ++i) {
			for (int j = 1; j + (1 << i) - 1 <= n; ++j) {
				st[j][i] = max(st[j][i - 1], st[j + (1 << (i - 1))][i - 1]);
			}
		}
	}
	int get(int l, int r) {
		if (l > r) return 0;
		int k = __lg(r - l + 1);
		return max(st[l][k], st[r - (1 << k) + 1][k]);
	}
} stmax;

vector<int> arr, store[N];
ll dp[N];
inline void solve() {
	
	sort(vall(arr));
	arr.erase(unique(vall(arr)), arr.end());
	int m = sze(arr);
	
	for (int i = 1; i <= n; ++i) {
		a[i] = lower_bound(vall(arr), a[i]) - arr.begin();
		store[a[i]].pb(i);
	}
	
	stmin.build();
	for (int i = d; i <= n; ++i) w[i] = stmin.get(i - d + 1, i);
	stmax.build();
	
	for (int i = 1; i <= n; ++i) {
		far[i] = i;
		if (i <= d) far[i] = 1;
		
		int l = d, r = i - 1;
		while(l <= r) {
			int mid = (l + r) >> 1;
			if (stmax.get(mid, i - 1) < a[i]) {
				far[i] = mid - d + 1;
				r = mid - 1;
			} else {
				l = mid + 1;
			}
		}
	}
	
	for (int j = 0; j < m; ++j) {
		for (int i : store[j]) dp[i] = st.get(1, 1, n, far[i], i - 1) + 1;
		for (int i : store[j]) st.update(1, 1, n, i, dp[i]);
	}
	
	ll ans = 0;
	for (int i = 1; i <= n; ++i) ans = max(ans, dp[i]);
	cout << ans;
	
	
	
}


inline void input() {
    cin >> n >> d;
    for (int i = 1; i <= n; ++i) {
    	cin >> a[i];
    	arr.pb(a[i]);
    }
    return solve();
}
bool END;

int main() {
    if(fopen(task ".inp", "r")) {
        freopen(task ".inp", "r", stdin);
        freopen(task ".out", "w", stdout);
    }
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr); cout.tie(nullptr);

    input();
    
    
    cerr << endl << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << 's' << endl;
    cerr << "Memory: " << fabs ((&END - &START)) / 1048576.0 << "MB\n";
    return 0;
}

Compilation message (stderr)

Main.cpp: In function 'int main()':
Main.cpp:142:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  142 |         freopen(task ".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:143:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  143 |         freopen(task ".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~

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