POJ 3672 Long Distance Racing(水题)

点击打开链接

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<map>
#include<vector>
#include<cmath>
using namespace std;
typedef long long ll;
const int maxn = 100000 + 5;

int main()
{
   map<char, int> mp;
   int M,T,U,F,D;
   int a[maxn];
   while(~scanf("%d%d%d%d%d",&M,&T,&U,&F,&D))//总时间、
   {
       memset(a, 0, sizeof(a));
       mp['u'] = U;
       mp['f'] = F;
       mp['d'] = D;
       char ch;
       int sum = 0;
       int ans = 0;
       for(int i = 0; i < T; i++)
       {
           cin >> ch;
           if(sum <= M)
           {
               sum += mp[ch];
               if(ch == 'f') sum += mp['f'];
               if(ch == 'u') sum += mp['d'];
               if(ch == 'd') sum += mp['u'];
               if(sum <= M)
                     ans++;
           }
           //a[i] = mp[ch];
           //cout << a[i] << endl;
       }
       printf("%d\n",ans);
   }
    return 0;
}