hdu 1257 最少拦截系统 dp

设dp【i】为第i套拦截系统的当前最小值，每次输出的时候看是否能更新所有的dp【i】，不行则说明需要加一套拦截系统

#include <map>
#include <set>
#include <queue>
#include <stack>
#include <vector>
#include <string>
#include <math.h>
#include <time.h>
#include <stdio.h>
#include <iomanip>
///cout << fixed << setprecision(13) << (double) x << endl;
#include <stdlib.h>
#include <string.h>
#include <iostream>
#include <algorithm>

using namespace std;

#define lson l, mid, rt << 1
#define rson mid + 1, r, rt << 1 | 1
#define ls rt << 1
#define rs rt << 1 | 1
#define pi acos(-1.0)
#define eps 1e-8
#define asd puts("sdfsdfsdfsdfsdfsdf");
#define Mp(a, b) make_pair(a, b)
typedef long long ll;
//typedef __int64 LL;
const int inf = 0x3f3f3f3f;

int dp[1011];
int n;

int main()
{
	int n;
	while( ~scanf("%d", &n) ) {
		int cnt = 0;
		dp[1] = 0;
		for( int i = 1, x, f; i <= n; ++i ) {
			f = 1;
			scanf("%d", &x);
			for( int j = 1; j <= cnt; ++j ) {
				if( dp[j] >= x ) {
					dp[j] = x, f = 0;
					break;
				}
			}
			if( f )
				dp[++cnt] = x;
		}
		printf("%d\n", cnt);
	}
	return 0;
}