[2016-03-27] [HDU] [1257] [Minimum interception system]

• Time: 2016-03-27-14:51:35 Sunday
• Title Number: [2016-03-27][hdu][1257][minimum interception system]
• Analysis: greedy, whenever unable to intercept the addition of an interception system, you can find that each interception system interception of the height of the comparison and the order of occurrence. That the second system is always higher than the first one.

  
 

   
  

  
#include <cstdio>
   
  

  
using namespace std;
   
  

  
int a[30000 + 10];
   
  

  
int main(){
   
  

  
 int n,b,flg;
   
  

  
 while(~scanf("%d",&n)){ 
   
  

  
  int   cur  =    1   a  [ 0  ]    =    30000  Span class= "PLN" >  +    10    
   
  

  
 for(int i = 0;i < n ; ++i){
   
  

  
 scanf("%d",&b);
   
  

  
 flg = 1;
   
  

  
 for(int j = 0;j < cur;++j){
   
  

  
 if(a[j] >= b){
   
  

  
 a[j] = b;
   
  

  
 flg = 0;
   
  

  
 break;
   
  

  
 } 
   
  

  
 }
   
  

  
 if(flg){
   
  

  
 a[cur] = b;
   
  

  
 ++cur;
   
  

  
 } 
   
  

  
 }
   
  

  
 printf("%d\n",cur);
   
  

  
 }
   
  

  
 return 0;
   
  

  
}
  
 

From for notes (Wiz)

[2016-03-27] [HDU] [1257] [Minimum interception system]