2020牛客寒假算法基础集训营1 I-nico和niconiconi

 #include <bits/stdc++.h>
 #define dbg(x) cout << #x << "=" << x << endl

 using namespace std;
 typedef long long LL;
 const int maxn = 3e5 + ;

 LL f[maxn];
 char ch[maxn];

 namespace _buff {
     const size_t BUFF =  << ;
     char ibuf[BUFF], *ib = ibuf, *ie = ibuf;
     char getc() {
         if (ib == ie) {
             ib = ibuf;
             ie = ibuf + fread(ibuf, , BUFF, stdin);
         }
         return ib == ie ? - : *ib++;
     }
 }

 int read() {
     using namespace _buff;
     int ret = ;
     bool pos = true;
     char c = getc();
     for (; (c < '' || c > '') && c != '-'; c = getc()) {
         assert(~c);
     }
     if (c == '-') {
         pos = false;
         c = getc();
     }
     for (; c >= '' && c <= ''; c = getc()) {
         ret = (ret << ) + (ret << ) + (c ^ );
     }
     return pos ? ret : -ret;
 }

 int main()
 {
     int n,a,b,c;
     scanf("%d %d %d %d\n",&n,&a,&b,&c);
     scanf("%s",ch+);
     for(int i = ; i <= n; ++i) {
         if(i > ) f[i] = f[i-];
         if(i >=  && ch[i-] == 'n' && ch[i-] == 'i' && ch[i-] == 'c' && ch[i] == 'o') {
             f[i] = max(f[i], f[i-] + a);
         }
         if(i >=  && ch[i-] == 'n' && ch[i-] == 'i' && ch[i-] == 'c' && ch[i-] == 'o' && ch[i-] == 'n' && ch[i] == 'i') {
             f[i] = max(f[i], f[i-] + b);
         }
         if(i >=  && ch[i-] == 'n' && ch[i-] == 'i' && ch[i-] == 'c' && ch[i-] == 'o' && ch[i-] == 'n' && ch[i-] == 'i' && ch[i-] == 'c' && ch[i-] == 'o' && ch[i-] == 'n' && ch[i] == 'i') {
             f[i] = max(f[i], f[i-] + c);
         }
     }
     cout << f[n] << endl;
     return ;
 }