摘要： #include <iostream>#include <string>#include <vector>#include <algorithm>using namespace std;typedef pair<int, int> word_index;typedef pair<int, int> lv1_index;#define NOT_VALUE 0xfffffffftypedef struct dp_item { int min_word_amount; int min_word_seq[200]; //最长的wo 阅读全文