HDU 1867 A + B for you again (KMP应用) Home » 编程开发 » HDU 1867 A + B for you again (KMP应用) Generally speaking, there are a lot of problems about s … 阅读更多
HDU1867 A + B for you again KMP应用 Home » 编程开发 » HDU1867 A + B for you again KMP应用 Problem Description Generally speaking, there are a lot … 阅读更多
TopCoder SRM496 Div1 YetAnotherHamiltonianPath解题报告 Home » 编程开发 » TopCoder SRM496 Div1 YetAnotherHamiltonianPath解题报告 题意: 有N<=50个城市,每个城市有一个名字(一个字符串)。从城市s走到城市t的代价是:|s|^2&# … 阅读更多