pat甲级1051

#include <iostream> #include<stdlib.h> #include<vector> using namespace std; vector<int>v; int m, n, k; bool isok() { vector<int>test; int maxnum = 0;//入过栈的最大值 for (int i = 0; i < n; i++) { if (t

>>阅读原文<<