UVALive5170 UVA231 POJ1887 Testing the CATCHER【最长下降子序列+DP+二分搜索】
2017-06-27 00:25
423 查看
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 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
Sample Output
Source
World Finals 1994
World Finals >> 1994
- Phoenix
问题链接:UVALive5170 UVA231 POJ1887 Testing the CATCHER。
题意简述:(略)
问题分析:这是一个经典的最长下降子序列问题。
程序说明:这个问题的输入数据个数比较怪一些,数据的结束条件与众不同,需要注意处理方式。
AC的C++语言程序如下:
Time Limit: 1000MS | Memory Limit: 30000K | |
Total Submissions: 18192 | Accepted: 6687 |
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
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
World Finals 1994
World Finals >> 1994
- Phoenix
问题链接:UVALive5170 UVA231 POJ1887 Testing the CATCHER。
题意简述:(略)
问题分析:这是一个经典的最长下降子序列问题。
程序说明:这个问题的输入数据个数比较怪一些,数据的结束条件与众不同,需要注意处理方式。
AC的C++语言程序如下:
/* UVALive5170 UVA231 POJ1887 Testing the CATCHER */ #include <iostream> #include <stdio.h> using namespace std; const int N = 32767; int dp[N+1]; int find(int low, int heigh, int m) { int mid; while(low <= heigh) { mid = (low + heigh) / 2; if(dp[mid] >= m) low = mid + 1; else heigh = mid - 1; } return low; } int main() { int caseno = 1, a, k; while(scanf("%d",&a) !=EOF && a != -1) { k = 1; dp[k] = a; while(scanf("%d",&a) !=EOF && a != -1) { if(a <= dp[k]) dp[++k] = a; else dp[find(1, k, a)] = a; } if(caseno >= 2) printf("\n"); printf("Test #%d:\n maximum possible interceptions: %d\n", caseno++, k); } return 0; }
相关文章推荐
- POJ-1887 Testing the CATCHER(dp,最长下降子序列)
- POJ 1887-Testing the CATCHER(dp_最长下降子序列)
- POJ-1887 Testing the CATCHER(dp,最长下降子序列)
- POJ1887 Testing the CATCHER 最大下降子序列 DP
- POJ 1887 Testingthe CATCHER (LIS:最长下降子序列)
- POJ 1887 —— Testing the CATCHER 最长下降子序列
- [dp] Testing the CATCHER 最长下降子序列问题
- POJ 1887 Testing the CATCHER(最长下降子序列)
- POJ1887 Testing the CATCHER 最大下降子序列 DP
- Pku1887----Testing the CATCHER (经典动态规划题:最长下降子序列),,,,,捎带pku2533---Longest Ordered Subsequence
- POJ-1887-Testing the CATCHER【最长不上升子序列nlogn】
- poj 1887 Testing the CATCHER (最长不上升子序列)
- DP_poj1887_Testing the CATCHER
- uva 231 Testing the CATCHER
- Testing the CATCHER - POJ 1887 最长递减子序列
- POJ 1887 Testing the CATCHER(最长递减子序列)
- 【POJ1887 || 2355 || 1631】Testing the CATCHER(最长递增(递减)子序列)NYOJ224
- poj 1887 Testing the CATCHER_最长上升子序列
- UVa 231 - Testing the CATCHER
- UVa231 - Testing the CATCHER