//owent.net/tags/zju.htmlRecent content in Zju on I'm OWenTHugozh-cn<a rel="license" href="https://github.com/owent/blog-hugo/blob/master/LICENSE.md"><img alt="知识共享许可协议" style="border-width:0" src="https://i.creativecommons.org/l/by-nc-sa/4.0/80x15.png" /></a>Mon, 15 Mar 2010 14:49:52 +0000//owent.net/2010/53.htmlMon, 15 Mar 2010 14:49:52 +0000//owent.net/2010/53.html<p>题目链接：<a href="http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=3309">http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=3309</a></p> <p>一道典型的Hash题</p> <p>题目很好理解。这里不复述</p> <p>由于输入语句最大数量200000，不用Hash铁定TLE。然后数据量不超过10000，所以必然有很多search和reply的操作。</p>