太菜了

#include <iostream>#include <cstring>#include <algorithm>#include <cstdio>#include <cmath>#include<string.h>#include<stdio.h>#include<vector>#include<map>#include<set>#include<stack&g

算法//快速排序，一般效率还是挺高的#include<bits/stdc++.h>using namespace std;int a[9]={15,29,135,18,32,1,27,25,5};void print(){ for(int i=0;i<10;i++){ printf(" %d",a[i]); } printf("\n");}void quicksort(int a[],int left,int right){/

设计一个O(n^2)时间的算法，找出由n个数字组成的序列的最长单调递增子序列。#include<bits/stdc++.h>using namespace std;int a[100];//先用冒泡试试int main(){ int n; scanf("%d",&n); for(int i=0;i<n;i++){ scan...