// UVa 10192 - Vacation #include <iostream> #include <string> #include <stdio.h> using namespace std; int main() { string a, b; int cases = 0; getline(cin, a); while (a[0] != '#') { cases++; getline(cin, b); int T[101][101]; T[0][0] = 0; for (int j = 1; j <= b.length(); j++) T[0][j] = 0; for (int i = 1; i <= a.length(); i++) { T[i][0] = 0; for (int j = 1; j <= b.length(); j++) { if (a[i - 1] == b[j - 1]) T[i][j] = T[i - 1][j - 1] + 1; else T[i][j] = max(T[i - 1][j], T[i][j - 1]); } } printf("Case #%d: you can visit at most %d cities.\n", cases, T[a.length()][b.length()]); getline(cin, a); } return 0; }
Friday, June 19, 2015
UVa 10192 - Vacation
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment