165172025-05-05 23:01:59algoproTornyokcpp17Accepted 100/100216ms20632 KiB
// UUID: f58c05a4-9cd0-456b-8507-2c92663d600a
#pragma GCC optimize("O3,unroll-loops,no-stack-protector")
#include <bits/stdc++.h>
using namespace std;

int main() {

	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);

	int n, q;
	cin >> n >> q;
	vector<int> sor(n), lis(n, INT_MAX), eloz(n, -1), st, lis_in_pos(n, 0);

	for (int i = 0; i < n; i++){
		cin >> sor[i];
		while(!st.empty() && sor[st.back()] < sor[i]) st.pop_back();
		if (!st.empty()) eloz[i] = st.back();
		st.push_back(i);
	}


	for (int i = n - 1; i >= 0; i--){
		if (eloz[i] != -1) lis_in_pos[eloz[i]] = max(lis_in_pos[eloz[i]], lis_in_pos[i] + 1);
		lis[lis_in_pos[i]] = min(lis[lis_in_pos[i]], sor[i]);
	}

	for (int i = 0; i < q; i++){
		int a;
		cin >> a;
		cout << lower_bound(lis.begin(), lis.end(), a) - lis.begin() << " ";
	}

}
SubtaskSumTestVerdictTimeMemory
base100/100
1Accepted0/01ms500 KiB
2Accepted0/0178ms13880 KiB
3Accepted2/21ms500 KiB
4Accepted2/21ms316 KiB
5Accepted6/61ms316 KiB
6Accepted6/61ms552 KiB
7Accepted4/410ms1360 KiB
8Accepted4/417ms2036 KiB
9Accepted8/857ms6620 KiB
10Accepted8/892ms11788 KiB
11Accepted5/5157ms13600 KiB
12Accepted5/5190ms16124 KiB
13Accepted5/530ms3124 KiB
14Accepted5/567ms7852 KiB
15Accepted5/5100ms11772 KiB
16Accepted5/5146ms11508 KiB
17Accepted5/5181ms13908 KiB
18Accepted5/5216ms16360 KiB
19Accepted5/5214ms16436 KiB
20Accepted5/5189ms20192 KiB
21Accepted5/5199ms20376 KiB
22Accepted5/5184ms20632 KiB