最少拦截系统

PRoblem Description

Input

Output

Example Input

8 389 207 155 300 299 170 158 65
Example Output
2#include<stdio.h>int dp[10000];int main(){    int n,x,i,t,flag;    int min;    while(~scanf("%d",&n))    {        t=0;        while(n--)        {            scanf("%d",&x);            flag=0;            min=30000;            for(i=0;i<t;i++)            {                if(x<=dp[i]&&min>dp[i]-x)                {                    min=dp[i]-x;                    dp[i]=x;                    flag=1;                }            }            if(flag==0)            {                dp[t]=x;                t++;            }        }        printf("%d/n",t);    }    return 0;}