sxk

UVa特别题库UVa网站专门为本书设立的分类题库配合，方便读者提交：http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=442注意，下面注有“extra”的习题并没有在书中出现，但在上面的特别题库中有，属于附加习题。基础练习 （Basic Problems）

PeriodTime Limit: 3000MS Memory Limit: Unknown 64bit IO Format: %lld & %lluSubmit StatusDescriptionFor each prefix of a given string S with N characters (

题目链接：Fire!解析：先用bfs处理出Fire到每个格子的最短时间。然后再使用bfs求出最短时间。注意：判断能否扩展的时候，要满足在格子着火之前才可以扩展。AC代码：#include #include #include #include using namespace std;const int maxn = 1000 + 5;char

3942 - Remember the WordNeal is very curious about combinatorial problems, and now here comes a problem about words. Knowing that Ray has a photographic memory and this may not trouble him, Neal

题目链接：https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=2832题意：模拟strcmp（）函数，给n个字符串，两两之间进行比较，问需要进行多少次比较？解析：字符串很多，数据量大，按题意两两比较显然不现实。如果把所有的单词插入到一棵Tr

1227: Integer GameTime Limit: 1 Sec  Memory Limit:128 MBSubmit: 9  Solved: 4[Submit][Status][Web Board]DescriptionTwo players, S and T, are playing a game where they make alternate mov

Count the TreesCrawling in process...Crawling failedTime Limit:3000MS    Memory Limit:0KB     64bit IO Format:%lld & %lluSubmitStatus Description  Count the T

Carmichael NumbersTime Limit: 3000MS Memory Limit: Unknown 64bit IO Format: %lld & %lluSubmitStatus Description  Carmichael Numbers 

A - Error CurvesTime Limit:3000MS    Memory Limit:0KB    64bit IO Format:%lld & %lluSubmitStatusPracticeUVALive 5009Appoint description:Description Josephina is a clever girl and

Game of SumTime Limit: 3000MS Memory Limit: Unknown 64bit IO Format: %lld & %lluSubmit  StatusDescriptionThis is a two player game. Initially there are n integer numbers in an array and pl