标签：
#include <vector> #include <list> #include <map> #include <set> #include <deque> #include <queue> #include <stack> #include <bitset> #include <algorithm> #include <functional> #include <numeric> #include <utility> #include <sstream> #include <iostream> #include <iomanip> #include <cstdio> #include <cmath> #include <cstdlib> #include <cctype> #include <string> #include <cstring> #include <cstdio> #include <cmath> #include <cstdlib> #include <ctime> using namespace std; typedef long long LL; #define CLR(x,y) memset((x),(y),sizeof((x))) #define FOR(x,y,z) for(int (x)=(y);(x)<(z);++(x)) #define FORD(x,y,z) for(int (x)=(y);(x)>=(z);--(x)) #define FOR2(x,y,z) int (x);for((x)=(y);(x)<(z);++(x)) #define FORD2(x,y,z) int (x);for((x)=(y);(x)>=(z);--(x)) const int maxn = 10000; int dp[maxn],a[maxn]; int main(){ //freopen("in.txt","r",stdin); //freopen("out.txt","w",stdout); int cntcase = 0; while(~scanf("%d",a) && ~a[0]){ int n = 1; CLR(dp,0); while(~scanf("%d",a + n) && ~a[n]) ++n; CLR(dp,0); FOR(i,0,n){ dp[i] = 1; FOR(j,0,i){ if(a[i] <= a[j]){ dp[i] = max(dp[i],dp[j] + 1); } } } int ans = 0; FOR(i,0,n){ ans = max(dp[i] , ans); } printf("Test #%d:\n maximum possible interceptions: %d\n\n",++cntcase,ans); } return 0; } |
标签：
原文地址：http://www.cnblogs.com/qhy285571052/p/5266570.html
