USACO 5.4 Character Recognition

http://train.usaco.org/usacoprob2?a=nOsVamksRaE&S=charrec

题目大意：一堆奇怪的字符，找到最小误差的匹配

方法：dp（这种按段划分，要求某个值最大或最小，很有dp的特征）

小tips：输入与模板按行匹配时可以记录下结果优化时间（看了USACO的官方解答才知道）

/*
ID: frontie1
TASK: charrec
LANG: C++
*/
#include <iostream>
#include <cstdio>
#include <string>

using namespace std;

const int INFI = 0x3f3f3f3f;

int N;
char dict[27][22][22];
char ori[1205][22];
int dp[1205];
string log[1205];

int compare_same(char model[][22], char obj[][22])
{
    int output = 0;
    for(int i = 0; i < 20; ++i){
        for(int k = 0; k < 20; ++k){
            if(model[i][k] != obj[i][k]) ++output;
        }
    }
    return output;
}

int compare_duplicate(char model[][22], char obj[][22])
{
    int output = INFI, tem = 0;

    for(int i = 0; i <= 20; ++i){
        tem = 0;
        int cur1 = 0, cur2 = 0;
        while(cur1 < 20){
            if(cur2 == i){
                ++cur2;
                continue;
            }
            for(int k = 0; k < 20; ++k){
                if(model[cur1][k] != obj[cur2][k]) ++tem;
            }
            ++cur1; ++cur2;
            if(tem >= output) break;
        }
        output = min(output, tem);
    }

    return output;
}

int compare_miss(char model[][22], char obj[][22])
{
//    for(int i = 0; i < 19; ++i){
//        for(int k = 0; k < 20; ++k){
//            cout << obj[i][k];
//        }
//        cout << endl;
//    }

    int output = INFI, tem = 0;

    for(int i = 0; i < 20; ++i){
        tem = 0;
        int cur1 = 0, cur2 = 0;
        while(cur1 < 20){
            if(cur1 == i){
                ++cur1;
                continue;
            }
            for(int k = 0; k < 20; ++k){
                if(model[cur1][k] != obj[cur2][k]) ++tem;
            }
            if(tem >= output) break;
            ++cur1; ++cur2;
        }
        output = min(output, tem);
//        if(dp[19] < 80 && output < dp[19]){
//            cout << endl;
//            cout << output << endl;
//            int cur1 = 0, cur2 = 0;
//            while(cur1 < 20){
//                if(cur1 == i){
//                    ++cur1;
//                    continue;
//                }
//                for(int k = 0; k < 20; ++k){
//                    if(model[cur1][k] != obj[cur2][k]) cout << 'x';
//                    else cout << model[cur1][k];
//                }
//                cout << endl;
//                ++cur1; ++cur2;
//            }
//        }
    }

    return output;
}

char decode(int i)
{
    if(i == 0) return ' ';
    else return (char)('a' + i - 1);
}

void print(char obj[][22], int lin)
{
    for(int i = 0; i < lin; ++i){
        for(int k = 0; k < 20; ++k){
            cout << obj[i][k];
        }
        cout << endl;
    }

}

int main()
{
    freopen("charrec.out", "w", stdout);

    freopen("font.in", "r", stdin);
    //cin >> N;
    scanf("%d", &N);
    for(int i = 0; i < 27; ++i){
        for(int k = 0; k < 20; ++k){
            //cin >> dict[i][k];
            scanf("%s", &(dict[i][k]));
        }
    }

    freopen("charrec.in", "r", stdin);
    //cin >> N;
    scanf("%d", &N);
    for(int i = 1; i <= N; ++i){
        //cin >> ori[i];
        scanf("%s", &(ori[i]));
    }

    for(int i = 1; i <= N; ++i){
        dp[i] = INFI;
    }
    dp[0] = 0; log[0] = "";

    for(int i = 1; i <= N; ++i){
        if(i >= 19 && dp[i-19] < dp[i]){
            for(int k = 0; k < 27; ++k){
                //if(dp[i-19] > dp[i]) continue;
                int tem = compare_miss(dict[k], &(ori[i-18]));
                if(tem > 120 || dp[i-19] + tem >= dp[i]) continue;
                dp[i] = dp[i-19] + tem;
                log[i] = log[i-19] + decode(k);
            }
        }

        if(i >= 20 && dp[i-20] < dp[i]){
            for(int k = 0; k < 27; ++k){
                //if(dp[i-20] >= dp[i]) continue;
                int tem = compare_same(dict[k], &(ori[i-19]));
                if(tem > 120 || dp[i-20] + tem >= dp[i]) continue;
                dp[i] = dp[i-20] + tem;
                log[i] = log[i-20] + decode(k);
            }
        }

        if(i >= 21 && dp[i-21] < dp[i]){
            for(int k = 0; k < 27; ++k){
                int tem = compare_duplicate(dict[k], &(ori[i-20]));
                if(tem > 120 || dp[i-21] + tem >= dp[i]) continue;
                dp[i] = dp[i-21] + tem;
                log[i] = log[i-21] + decode(k);
            }
        }
    }

//    for(int i = 0; i <= N; ++i){
//        if(dp[i] == INFI) continue;
//        if(i + 19 <= N){
//            for(int k = 0; k < 27; ++k){
//                int tem = compare_miss(dict[k], &(ori[i+1]));
//                if(tem > 120 || dp[i] + tem > dp[i+19]) continue;
//                dp[i+19] = dp[i] + tem;
//                log[i+19] = log[i] + decode(k);
//            }
//        }
//
//        if(i + 20 <= N){
//            for(int k = 0; k < 27; ++k){
//                int tem = compare_same(dict[k], &(ori[i+1]));
//                if(tem > 120 || dp[i] + tem > dp[i+20]) continue;
//                dp[i+20] = dp[i] + tem;
//                log[i+20] = log[i] + decode(k);
//            }
//        }
//
//        if(i + 21 <= N){
//            for(int k = 0; k < 27; ++k){
//                int tem = compare_duplicate(dict[k], &(ori[i+1]));
//                if(tem > 120 || dp[i] + tem > dp[i+21]) continue;
//                dp[i+21] = dp[i] + tem;
//                log[i+21] = log[i] + decode(k);
//            }
//        }
//    }

    cout << log[N] << endl;

    return 0;
}