UVa 12325 Zombie's Treasure Chest【暴力】

题意：和上次的cf的ZeptoLab的C一样，是紫书的例题7-11

不过在uva上交的时候，用%I64d交的话是wa，直接cout就好了

 #include<iostream>
 #include<cstdio>
 #include<cstring>
 #include <cmath>
 #include<stack>
 #include<vector>
 #include<map>
 #include<set>
 #include<queue>
 #include<algorithm>
 #define mod=1e9+7;
 using namespace std;

 typedef long long LL;
 const int INF = 0x7fffffff;

 int main(){
     int n,s1,s2,v1,v2,ncase,kase;
     scanf("%d",&ncase);
     for(kase=;kase<=ncase;kase++){
         cin>>n>>s1>>v1>>s2>>v2;
         LL ans=;
         for(LL i=;i<;i++){
             if(i*s1<=n)
             ans=max(ans,(n-i*s1)/s2*v2+i*v1);
             if(i*s2<=n)
             ans=max(ans,(n-i*s2)/s1*v1+i*v2);
         }
         printf("Case #%d: ",kase);
         cout<<ans<<"\n";
     }
     return ;
 }

加油啊= =