思路:
用vector模拟队列(左边是队头),保证每个队列都是从左到右单调递减的,最终输出所需队列的个数。
#include <iostream>
#include <vector>
using namespace std;
int main()
{
int n;
cin>>n;
int a[n];
for(int i=0;i<n;i++){
cin>>a[i];
}
vector<vector<int> > queues;
for (int i = 0; i < n; ++i){
bool added = false;
for ( auto &q : queues ) {
if ( q[q.size()-1]>a[i] ) {
q.push_back(a[i]);
added = true;
break;
}
}
if (!added) {
vector<int> new_queue = {a[i]};
queues.push_back(new_queue);
}
}
// for( auto queue : queues ) {
// for( auto v : queue ) {
// cout << v << " ";
// }
// cout << endl;
// }
cout << queues.size() << endl;
return 0;
}
/*
9
8 4 2 5 3 9 1 6 7
8 4 2 1
5 3
9 6
7
*/