제출 #1163476

#제출 시각아이디문제언어결과실행 시간메모리
1163476hmm789Volontiranje (COCI21_volontiranje)C++20
0 / 110
0 ms320 KiB
#include <bits/stdc++.h>
using namespace std;
#define int long long 

int32_t main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0); cout.tie(0);
	int n, lis = 0;
	cin >> n;
	int a[n], dp[n];
	vector<int> v[n+1];
	for(int i = 0; i < n; i++) cin >> a[i];
	for(int i = 0; i < n; i++) {
		dp[i] = 1;
		for(int j = 0; j < i; j++) if(a[j] < a[i]) dp[i] = max(dp[i], dp[j]+1);
		v[dp[i]].push_back(i);
		lis = max(lis, dp[i]);
	}
	for(int i = 1; i <= n; i++) reverse(v[i].begin(), v[i].end());
	vector<vector<int>> ans;
	while(1) {
		vector<int> tmp;
		for(int i = 1; i <= lis; i++) {
			while(tmp.size() && v[i].size() && v[i].back() <= tmp.back()) v[i].pop_back();
			if(v[i].empty()) goto ed;
			tmp.push_back(v[i].back());
			v[i].pop_back();
		}
		ans.push_back(tmp);
	}
	ed:;
	cout << ans.size() << " " << lis << '\n';
	for(auto i : ans) {
		for(auto j : i) cout << j+1 << " ";
		cout << '\n';
	}
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...