2013年10月30日
How Many Tables 并查集（求有几个集合）
摘要： Problem DescriptionToday is Ignatius' birthday. He invites a lot of friends. Now it's dinner time. Ignatius wants to know how many tables he needs at least. You have to notice that not all the friends know each other, and all the friends do not want to stay with strangers.One important rule 阅读全文
posted @ 2013-10-30 20:29 persistent codeants 阅读(255) 评论(0) 推荐(0)
Spell checker 字典树&&普通查找（加计数）
摘要： Problem DescriptionYou, as a member of a development team for a new spell checking program, are to write a module that will check the correctness of given words using a known dictionary of all correct words in all their forms.If the word is absent in the dictionary then it can be replaced by correct 阅读全文
posted @ 2013-10-30 19:46 persistent codeants 阅读(287) 评论(0) 推荐(0)
昂贵的聘礼 dijstra算法（要枚举源点）
摘要： Problem Description年轻的探险家来到了一个印第安部落里。在那里他和酋长的女儿相爱了，于是便向酋长去求亲。酋长要他用10000个金币作为聘礼才答应把女儿嫁给他。探险家拿不出这么多金币，便请求酋长降低要求。酋长说："嗯，如果你能够替我弄到大祭司的皮袄，我可以只要8000金币。如果你能够弄来他的水晶球，那么只要5000金币就行了。"探险家就跑到大祭司那里，向他要求皮袄或水晶球，大祭司要他用金币来换，或者替他弄来其他的东西，他可以降低价格。探险家于是又跑到其他地方，其他人也提出了类似的要求，或者直接用金币换，或者找到其他东西就可以降低价格。不过探险家没必要用多样东 阅读全文
posted @ 2013-10-30 09:48 persistent codeants 阅读(348) 评论(0) 推荐(0)