拦截导弹问题

 1 // the solution of the missile
 2 // use the DP(dynamic process) algorithms
 3 #include<iostream>
 4 
 5 #define MAX 100//define the missile max total number
 6 using namespace std;
 7 
 8 void calc(int a[],int i)
 9 {
10     int b[MAX];
11     b[0]=a[0];
12     int ptr=0;
13     int m,k;
14 
15     for( k=1;k<i;k++)
16     {
17         
18           if(a[k]<=b[ptr])//加入数组末尾,非递减序列
19             {
20                 ptr++;
21                 b[ptr]=a[k];
22             
23             }
24             else//将a[k]放入数组B的正确位置
25             {
26                 for(int n=0;n<=ptr;n++)
27                 {
28                     if(a[k]>b[n])
29                     {
30                         b[n]=a[k];
31                         break;
32                     }
33                 }
34                 
35             }
36 
37     
38     }
39     cout<<"the total number of the missile is:"<<ptr+1<<endl;
40     for(k=0;k<=ptr;k++)
41         cout<<b[k]<<" ";
42    
43 
44 }
45 
46 int main()
47 {
48     int arr[MAX]={0};
49     int i;
50     cout<<"Input the total missile number:";
51     cin>>i;
52     int k=0;
53     while(i>0)
54     {
55         cin>>arr[k];
56         k++;
57         i--;
58     }
59     calc(arr,k);
60     return 0;
61 }