hdu 3486 Interviewe (RMQ)

///将面试人按顺序分组，每组录取一个，找到最小的分组数是的录取能力总和大于k
# include 
  
   
# include 
   
     # include 
    
      # include 
     
       # include 
      
        using namespace std; int a1[200010]; int dp[200010][20]; int n; void RMQ_init() { for(int i=1; i<=n; i++) dp[i][0]=a1[i]; int k=(int)(log(n+1.0)/log(2.0)); for(int j=1; j<=k; j++) for(int i=1; i+(1<
       






        k) break; pre=len; temp=m; } if(i==n+1) printf("-1\n"); else printf("%d\n",i); } } return 0; }