|
Language: Default Testing the CATCHER
Description A military contractor for the Department of Defense has just completed a series of preliminary tests for a new defensive missile called the CATCHER which is capable of intercepting multiple incoming offensive missiles. The CATCHER is supposed to be a remarkable The tests which the contractor completed were computer simulations of battlefield and hostile attack conditions. Since they were only preliminary, the simulations tested only the CATCHER‘s vertical movement capability. In each simulation, the CATCHER was fired The result of each test is reported as the sequence of incoming missiles and the total number of those missiles that are intercepted by the CATCHER in that test. The General Accounting Office wants to be sure that the simulation test results submitted by the military contractor are attainable, given the constraints of the CATCHER. You must write a program that takes input data representing the pattern of incoming missiles The incoming missile is the first missile to be intercepted in this test. -or- The missile was fired after the last missile that was intercepted and it is not higher than the last missile which was intercepted. Input The input data for any test consists of a sequence of one or more non-negative integers, all of which are less than or equal to 32,767, representing the heights of the incoming missiles (the test pattern). The last number in each sequence is -1, which signifies Output Output for each test consists of a test number (Test #1, Test #2, etc.) and the maximum number of incoming missiles that the CATCHER could possibly intercept for the test. That maximum number appears after an identifying message. There must be at least one Note: The number of missiles for any given test is not limited. If your solution is based on an inefficient algorithm, it may not execute in the allotted time. Sample Input 389 207 155 300 299 170 158 65 -1 23 34 21 -1 -1 Sample Output Test #1: maximum possible interceptions: 6 Test #2: maximum possible interceptions: 2 Source |
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<queue>
#include<stack>
#include<vector>
#define L(x) (x<<1)
#define R(x) (x<<1|1)
#define MID(x,y) ((x+y)>>1)
#define eps 1e-8
using namespace std;
#define N 10005
int a[N],dp[N];
int main()
{
int i,j,n,x,ca=0;
while(scanf("%d",&x))
{
if(x==-1) break;
n=0;
a[n++]=x;
while(1)
{
scanf("%d",&x);
if(x==-1) break;
a[n++]=x;
}
dp[0]=1;
int ans=1;
int temp;
for(i=1;i<n;i++)
{
temp=0;
for(j=0;j<i;j++)
if(a[j]>a[i]&&temp<dp[j])
temp=dp[j];
dp[i]=temp+1;
if(ans<dp[i])
ans=dp[i];
}
printf("Test #%d:\n",++ca);
printf(" maximum possible interceptions: %d\n\n",ans);
}
return 0;
}