(自坑,复习)poj 1887 水题 最长不升子序列
来源:互联网 发布:如何查询网络是否稳定 编辑:程序博客网 时间:2024/06/05 22:49
Testing the CATCHER
Time Limit: 1000MS Memory Limit: 30000KTotal Submissions: 15180 Accepted: 5585
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 defensive missile. It can move forward, laterally, and downward at very fast speeds, and it can intercept an offensive missile without being damaged. But it does have one major flaw. Although it can be fired to reach any initial elevation, it has no power to move higher than the last missile that it has intercepted.
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 at a sequence of offensive missiles which were incoming at fixed time intervals. The only information available to the CATCHER for each incoming missile was its height at the point it could be intercepted and where it appeared in the sequence of missiles. Each incoming missile for a test run is represented in the sequence only once.
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 for several different tests and outputs the maximum numbers of missiles that the CATCHER can intercept for those tests. For any incoming missile in a test, the CATCHER is able to intercept it if and only if it satisfies one of these two conditions:
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.
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 at a sequence of offensive missiles which were incoming at fixed time intervals. The only information available to the CATCHER for each incoming missile was its height at the point it could be intercepted and where it appeared in the sequence of missiles. Each incoming missile for a test run is represented in the sequence only once.
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 for several different tests and outputs the maximum numbers of missiles that the CATCHER can intercept for those tests. For any incoming missile in a test, the CATCHER is able to intercept it if and only if it satisfies one of these two conditions:
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 the end of data for that particular test and is not considered to represent a missile height. The end of data for the entire input is the number -1 as the first value in a test; it is not considered to be a separate test.
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 blank line between output for successive data sets.
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.
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
38920715530029917015865-1233421-1-1
Sample Output
Test #1: maximum possible interceptions: 6Test #2: maximum possible interceptions: 2
Source
World Finals 1994
题目大意:
求最长不升子序列长度
反省&感想:
WA了很多炮,最后发现是因为,dp[n-1]不一定就是答案,因为dp[n-1]可能会是初始化的1(当a[n-1]大于其他所有a时)
加了一个循环遍历所有dp求最大值就过了
自己还是不够仔细.....一定要在脑中将dp过程理清楚,保证正确才行
下面是ac代码:
#include <iostream>#include <string.h>#include <stdio.h>#include <stdlib.h>#include <math.h>#include <memory.h>#include <string>#include <vector>#include <list>#include <map>#include <queue>#include <stack>#include <bitset>#include <algorithm>#include <numeric>#include <functional>#define maxn 6000005using namespace std;int a[maxn];int dp[maxn];int main(){ int cas=1; while(1){ scanf("%d",a); if(a[0]==-1) return 0; int t=0; for(int i=1;a[i-1]!=-1;i+=1,t+=1){ scanf("%d",&a[i]); } for(int i=0;i<t;i+=1) dp[i]=1; int ans=-1; dp[0]=1; for(int i=0;i<t;i+=1){ for(int j=0;j<i;j+=1){ if(a[i]<=a[j]){ dp[i]=max(dp[i],dp[j]+1); } } ans=max(ans,dp[i]); } printf("Test #%d:\n maximum possible interceptions: %d\n\n",cas++,ans); } return 0;}
0 0
- (自坑,复习)poj 1887 水题 最长不升子序列
- (复习)poj 1952 最长下降子序列—— dp+方案个数
- poj 1887 Testing the CATCHER 最长不升子序列
- poj 1887Testing the CATCHER(最长下降子序列)
- POJ 1887 Testing the CATCHER(最长递减子序列)
- POJ 1887 Testing the CATCHER(最长下降子序列)
- poj 1887 最长不上升子序列
- poj 1887 最长下降子序列
- poj 1887 dp最长下降子序列
- poj 3903(最长上升子序列 )
- POJ 1080(最长公共子序列)
- POJ 1458(最长公共子序列)
- POJ 3356 (最长公共子序列)
- 复习一下最长不下降子序列
- POJ 1836 Alignment(DP max(最长上升子序列 + 最长下降子序列))
- poj 1836 Alignment -dp(合唱队形变式)-最长上升子序列+最长下降子序列
- poj 1887 Testing the CATCHER (最长不上升子序列)
- POJ-1887 Testing the CATCHER(dp,最长下降子序列)
- Java 集合的使用
- NYOJ 题目95 众数问题
- Zend Studio 10.6.0正式版注册破解
- 每天一个linux命令:crontab命令
- Balanced Binary Tree
- (自坑,复习)poj 1887 水题 最长不升子序列
- 使用Inputstream读取文件
- Ubuntu 之 vmware
- 简单链表(C实现)
- ACdream 1099 (STL:求数组中第k小的数)
- Matrix Chain Multiplication (UVa 442)
- java中常见错误
- 深析静态链接库和动态链接库相同函数覆盖及库调用顺序问题
- UDP会话单例(windows)