zoukankan      html  css  js  c++  java
  • 【POJ 3267】The Cow Lexicon

    The Cow Lexicon
    Time Limit: 2000MS   Memory Limit: 65536K
    Total Submissions: 8901   Accepted: 4224

    Description

    Few know that the cows have their own dictionary with W (1 ≤ W ≤ 600) words, each containing no more 25 of the characters 'a'..'z'. Their cowmunication system, based on mooing, is not very accurate; sometimes they hear words that do not make any sense. For instance, Bessie once received a message that said "browndcodw". As it turns out, the intended message was "browncow" and the two letter "d"s were noise from other parts of the barnyard.

    The cows want you to help them decipher a received message (also containing only characters in the range 'a'..'z') of length L (2 ≤ L ≤ 300) characters that is a bit garbled. In particular, they know that the message has some extra letters, and they want you to determine the smallest number of letters that must be removed to make the message a sequence of words from the dictionary.

    Input

    Line 1: Two space-separated integers, respectively: W and L 
    Line 2: L characters (followed by a newline, of course): the received message 
    Lines 3..W+2: The cows' dictionary, one word per line

    Output

    Line 1: a single integer that is the smallest number of characters that need to be removed to make the message a sequence of dictionary words.

    Sample Input

    6 10
    browndcodw
    cow
    milk
    white
    black
    brown
    farmer

    Sample Output

    2

    Source

     
    近乎裸的区间DP。
    预处理出weight[i][j]数组,记录一下这个区间能最少删多少个字母可以成为字典中的单词,其实可以不用枚举区间,枚举开头即可。
    然后直接DP;
    下面的代码可以不用记录words。
    #include <cstdio>
    #include <cstring>
    #include <algorithm>
    
    using namespace std;
    
    const int MAXL = 305;
    
    char words[605][30], context[MAXL];
    int w, l, weight[MAXL][MAXL], d[MAXL][MAXL], slen[605];
    
    int solve(int L, int R)
    {
        if (d[L][R] != -1) return d[L][R];
        d[L][R] = weight[L][R];
        for (int i = L + 1; i <= R; ++i)
            d[L][R] = min(d[L][R], solve(L, i - 1) + solve(i, R));
        return d[L][R];
    }
    
    int main()
    {
        scanf("%d%d", &w, &l);
        scanf("%s", context);
        for (int i = 0; i < w; ++i) scanf("%s", words[i]), slen[i] = strlen(words[i]);
        memset(d, -1, sizeof(d));
        for (int i = 0; i < l; ++i)
            for (int j = i; j < l; ++j)
                weight[i][j] = j - i + 1;
        for (int i = 0; i < l; ++i)
            for (int k = 0; k < w; ++k)
            {
                int head1, head2;
                for (head1 = i, head2 = 0; head1 < l && head2 < slen[k]; ++head1)
                    if (context[head1] == words[k][head2]) head2++;
                if (head2 == slen[k]) weight[i][head1 - 1] = min(weight[i][head1 - 1], head1 - i - slen[k]); 
            }
        printf("%d
    ", solve(0, l - 1));
        return 0;
    }
  • 相关阅读:
    js 操作cookie
    Java——简单实现学生管理系统
    虚方法--重载
    读取Devexpress内部的图标
    ToolTipController 事件触发显示时 避免闪烁的处理方法
    windowsAPI遍历文件夹(速度高于递归)
    XAF去掉View页面的编辑器
    禁用弹出提示框
    设置程序集(dll)引用路径,整洁美观
    WPF移动Window窗体(鼠标点击左键移动窗体自定义行为)
  • 原文地址:https://www.cnblogs.com/albert7xie/p/4887543.html
Copyright © 2011-2022 走看看