CodeForces 19B Checkout Assistant dp

2015-07-24 05:49:48 · 作者: · 浏览: 6

题目链接:点击打开链接



#include 
  
   
#include 
   
     #include 
    
      #include 
     
       #include 
      
        #include 
        #include 
        
          #include 
         
           using namespace std; #define inf 1152921504606846976 #define ll __int64 #define N 2005 ll n; ll dp[N<<1], c[N], t[N]; int main(){ ll i, j; while(cin>>n) { for(i=1;i<=n;i++) { cin>>t[i]>>c[i]; t[i]++; dp[i] = inf; } ll sum = inf; for(i=1;i<=n;i++) { for(j=n;j>=0;j--) if(dp[j] != inf || !j) { if(j+t[i]