|Tyvj|NOIP1999|动态规划|贪心|P1878 拦截导弹

http://tyvj.cn/p/1878

第一问：最长不上升子序列dp

第二问：贪心

#include<cstdio>#include<cstring>#include<algorithm>using namespace std;int main () {    const int maxn = 100 + 5;    int dd[maxn];    int n=0;    int yyy;    while (scanf("%d", &yyy)!=EOF) {n++; dd[n] = yyy;}    int d[maxn];    d[1] = 1;    int maxd = -1;    for (int i=2;i<=n;i++)     {d[i] = 1;   for (int j=1;j<i;j++)    {      if (dd[j]>=dd[i])   {d[i] = max(d[i], d[j]+1);  }   }   maxd = max(d[i], maxd);}printf("%d\n", maxd);int k = 1; //用了多少个机器int ma[maxn];//机器拦截高度ma[k] = dd[1];for (int i=2;i<=n;i++) {int p = 0;for (int j=1;j<=k;j++){if (ma[j]>=dd[i]){if (p==0) p = j;else if (ma[j]<ma[p]) p = j;}} if (p==0) {k++;ma[k] = dd[i];} else ma[p] = dd[i];} printf("%d\n", k);return 0;}