UVA 231 最长下降子序列
来源:互联网 发布:wechat是什么软件 编辑:程序博客网 时间:2024/05/20 16:35
http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=167
Testing the CATCHER
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.
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.
Sample Input
38920715530029917015865-1233421-1-1
Sample Output
Test #1: maximum possible interceptions: 6Test #2: maximum possible interceptions: 2
#include <stdio.h>#include <string.h>#include <iostream>using namespace std;int a[100005],dp[100005];int main(){ int b,count=1; while(scanf("%d",&b)&&b!=-1) { a[0]=b; int n=1; while(b!=-1) { scanf("%d",&b); a[n++]=b; } for(int i=0; i<n; i++) dp[i]=0; for(int i=1; i<n; i++) for(int j=0; j<i; j++) { if(a[i]<a[j]) { dp[i]=max(dp[i],dp[j]+1); } } if(count==1) printf("Test #%d:\n maximum possible interceptions: %d\n",count++,dp[n-1]); else printf("\nTest #%d:\n maximum possible interceptions: %d\n",count++,dp[n-1]); } return 0;}
- UVA 231 最长下降子序列
- 最长下降子序列
- 最长下降子序列
- 最长下降子序列
- 最长不下降子序列
- poj1887(最长下降子序列)
- 最长上升下降子序列
- 最长不下降子序列
- 最长不下降子序列
- 最长不下降子序列
- POJ1887 最长下降子序列
- 最长不下降子序列
- 最长不下降子序列
- 最长不下降子序列
- 最长不下降子序列
- 最长不下降子序列
- 最长下降子序列优化
- poj1887(最长下降子序列)
- 插入排序,选择排序,Shell排序
- UVa 133 - The Dole Queue
- 目标跟踪学习系列五:Real-time visual tracking via online weighted multiple instance learning(WMIL)学习
- 从一个题看python凶残
- UIView设置阴影
- UVA 231 最长下降子序列
- lwqq的安装
- 线程安全
- LeetCode 101 Symmetric Tree
- ArcGIS Runtime SDK for iOS开发系列教程(2)——MapViewDemo解析
- 编写第一个 Java 应用程序
- 最大子数组和及最小子数组和
- 利用MFC 生成 CRC32 检验码
- 用友U8数据库“具有不一致的元数据”的修复