#include <cstdlib>
#include <iostream>
#include <algorithm>
using namespace std;
int daodan(int n, int a[])
{
int dp[100001] ;
dp[0] = 100000 ;
dp[1] = a[1] ;
int i, j, s=1, l, r, mid, ans ;
for(i=2;i<=n;i++)
{
if(a[i]<=dp[s])
{
s++ ;
dp[s] = a[i] ;
}
else
{
l = 0 ;
r = s ;
while(l<=r)
{
mid = (l+r)/2 ;
if(dp[mid]>=a[i])
{
ans = mid ;
l = mid + 1 ;
}
else
r = mid - 1 ;
}
dp[ans+1] = a[i] ;
}
}
return s ;
}
int main()
{
int n=1, a[100001], s=0, i, maxs, ans=0 ;
char c ;
while(cin >> a[n])
n++ ;
n-- ;
cout << daodan(n,a) << endl ;
while(s<n)
{
maxs = 100000 ;
for(i=1;i<=n;i++)
{
if(a[i]<=maxs && a[i]>=0)
{
s++ ;
maxs = a[i] ;
a[i] = -1 ;
}
}
ans++ ;
}
cout << ans << endl ;
return 0 ;
}
[NOIP1999 普及组] 导弹拦截
最新推荐文章于 2024-07-10 16:47:58 发布