제출 #1307347

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

Main

//#pragma GCC optimize("O3,unroll-loops")
//#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#include<bits/stdc++.h>
#define ll long long
#define F first
#define S second
#define pb push_back
#define pf push_front
#define ppb pop_back
#define ppf pop_front
#define all(x) x.begin(), x.end()

const int mod = 1e9 + 7;
const int N = 500001;

using namespace std;

ll n, m, t[N * 4],mx[N],used[N];
pair <ll, ll> p[N];
vector <ll> v;

void upd (ll idx, ll val, ll tl = 1, ll tr = n, ll v = 1){
	if (tl == tr){
		t[v] = val;
		return;
	}
	ll tm = (tl + tr) / 2;
	if (tm < idx){
		upd (idx, val, tm + 1, tr, v + v + 1);
	}
	else{
		upd (idx, val, tl, tm, v + v);
	}
	t[v] = max (t[v + v], t[v + v + 1]);
}

ll get (ll l, ll r, ll tl = 1, ll tr = n, ll v = 1){
	if (tr < l || tl > r){
		return 0;
	}
	if (l <= tl && tr <= r){
		return t[v];
	}
	ll tm = (tl + tr) / 2;
	return max (get (l, r, tl, tm, v + v), get (l, r, tm + 1, tr, v + v + 1));
}

signed main (){
	ios_base::sync_with_stdio(0);
	cin.tie(0); cout.tie(0);
	cin >> n >> m;
	for (int i = 1; i <= n; i++){
		cin >> p[i].F;
		p[i].S = i;
	}
	sort (p + 1, p + n + 1);
	p[n + 1].F = -1;
	ll a = 0;
	for (int i = 1; i <= n + 1; i++){
		if (p[i].F != p[i - 1].F){
			sort (all (v));
			reverse (all (v));
			for (auto j: v){
				mx[j] = 1;
				ll cnt = 0;
				for (int k = j - 1; k >= 1; k--){
					if (used[k] == 0){
						cnt++;
					}
					else{
						mx[j] = max (mx[k] + 1, mx[j]);	
						cnt = 0;		
					}
					if (cnt == m){
						break;
					}
				}
				a = max (a, mx[j]);
//				upd (j, get (L, j) + 1);
				used[j] = 1;
			}
			v.clear();
		}
		v.pb (p[i].S);
	}
	cout << a;
}

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