map
画船听雨
和梦想谈一次恋爱,也要疯狂,也要坚持
展开
-
SDUT OJ 2693 Babelfish (map练习)
这是一道典型的map但也可以用字典树与排序二叉树A、、、嘿嘿题目描述You have just moved from Waterloo to a big city. The people here speak an incomprehensible dialect of a foreign language. Fortunately, you have a dictionary原创 2013-08-10 16:36:33 · 2990 阅读 · 0 评论 -
POJ 3096 Surprising Strings
中级的水题,map就可以水过、、主要是练习一下map的使用。题意就是:判断间隔长度相同的连续的两个字符串是否相同,如果不相同就输出is NOT surprising.否则输出is surprising.Surprising StringsTime Limit: 1000MS Memory Limit: 65536KTotal Submissi原创 2013-09-27 20:28:13 · 1117 阅读 · 0 评论 -
sdut1500 Message Flood
一开始用的暴搜各种超时啊。。。时间复杂度On*m大约得4亿必须超时啊。。。。后来看了LZN同学的mp瞬间感觉好简单啊。。可惜菜鸟C++不精通啊。。。以后要好好的学习啊。。。。Well, how do you feel about mobile phone? Your answer would probably be something like that "It's so conven原创 2013-06-26 20:59:22 · 2461 阅读 · 0 评论 -
poj 2503 Babelfish
这道题周赛做过啊,#include #include #include #include #include using namespace std;int main(){ map map1; char a[50],b[20],c[20]; while(gets(a)&&a[0]!='\0') { sscanf(a,"%s %s",b原创 2013-08-21 19:34:15 · 2145 阅读 · 0 评论