hdu5455(2015沈阳网络赛F题)

题意：

给出一个串，问用题中定义的那些串来组成这个串最少要用多少个。

思路：

没啥说的，注意一下输入的串中可能出现除了c和f的字母。

代码：

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<map>
#include<vector>
#include<string>
#include<set>
#include<queue>
#include<stack>
#include<cmath>
#include<climits>

using namespace std;

char ch[1000100];

int main()
{
    int t;
    int kase = 1;
    scanf("%d", &t);
    while (t--) {
        scanf("%s", ch);
        int start = -1;
        int len = strlen(ch);
        int ook = 0;

        for (int i = 0; i < len; i++) {
            if ( ! (ch[i] == 'c' || ch[i] == 'f')) {
                ook = 1;
                printf("Case #%d: -1\n", kase++);
                break;
            }
        }
        if (ook == 1) {
            continue;
        }
            
        for (int i = 0; i < len; i++) {
            if (ch[i] == 'c') {
                start = i;
                break;
            }
        }

        if (start == -1) {
            int nans = 0;
            nans = len / 2;
            if (len & 1) {
                nans++;
            }
            printf("Case #%d: %d\n", kase++, nans);
        }
        else {
            int ans = 0;
            int ok = 0;
            int numf = -1;
            for (int i = start; i < len; i++) {
                if (ch[i] == 'c') {
                    if (numf == -1 || numf >= 2) {
                        ans++;
                        numf = 0;
                    }
                    else {
                        ok = 1;
                        break;
                    }
                }
                else {
                    numf++;
                }
                if (ok == 1) {
                    break;
                }
            }

            if (ok != 1) {
                for (int i = 0; i < start; i++) {
                    if (ch[i] == 'c') {
                        if (numf == -1 || numf >= 2) {
                            ans++;
                            numf = 0;
                        }
                        else {
                            ok = 1;
                            break;
                        }
                    }
                    else {
                        numf++;
                    }
                    if (ok == 1) {
                        break;
                    }
                }
            }

            if ( !(numf == -1 || numf >= 2)) {
                ok = 1;
            }

            if (ok == 1) {
                printf("Case #%d: -1\n", kase++);
            }
            else {
                printf("Case #%d: %d\n", kase++, ans);
            }
        }
    }
    return 0;
}