hdoj1257_最少拦截系统（dp）

#include<iostream>
#include<vector>

using namespace std;

int input[30001];
vector<int> no;

int solve(int n)
{
no.clear();
for (int i = 0; i < n; i++)
{
int j = 0;
for (; j < no.size(); j++)
{
if (input[i] <= no[j])
{
no[j] = input[i];
break;
}
}
if (j == no.size())
no.push_back(input[i]);
}
return no.size();
}

int main()
{
int n;
while (cin >> n)
{
for (int i = 0; i < n; i++)
cin >> input[i];
cout<<solve(n) << endl;
}
return 0;
}