1260：【例9.4】拦截导弹(Noip1999)

wmh100400

于 2024-08-19 20:21:34 发布

阅读量164

点赞数 5

文章标签：算法 c++ 数据结构

本文链接：https://blog.csdn.net/wmh100400/article/details/141334090

版权

#include<bits/stdc++.h>
using namespace std;
int a[100005], d[100005], len, h, n;
int main()
{
	while(cin >> h)
		a[++n] = h;
	d[++len] = a[1];
	for(int i = 2; i <= n; ++i)
	{
	    if(a[i] <= d[len])
            d[++len] = a[i];
	    else
	    {
	        int l = 1, r = len, m;
	        while(l < r) 
	        {
	            m = (l+r)/2;
	            if(d[m] < a[i])
	               r = m;
	            else
	               l = m+1;
            }
            d[l] = a[i];
        }
    }
    cout << len << endl;
    len = 0;
    d[++len] = a[1];
	for(int i = 2; i <= n; ++i)
	{
	    if(a[i] > d[len])
	        d[++len] = a[i];
	    else
	    {
            int