关闭

ICPC2017网络赛(北京)Minimum(树状数组区间最值维护)

描述 You are given a list of integers a0, a1, …, a2^k-1. You need to support two types of queries: 1. Output Minx,y∈[l,r] {ax∙ay}. 2. Let ax=y. 输入 The first line is an integer T, indicating the number of test cases. (1≤T≤10). For each test case: The fi...
阅读(109) 评论(0)

ICPC2017网络赛(青岛)1003 HDU 6208 字符串匹配KMP

The Dominator of Strings Time Limit: 3000/3000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others) Total Submission(s): 381 Accepted Submission(s): 97 Problem Description Here you have a set of strings. A dominator is a string of the set d...
阅读(487) 评论(0)

AC自动机 HDU2222 Keywords Search

AC自动机 Keywords Search Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others) Total Submission(s): 67751 Accepted Submission(s): 22807 Problem Description In the modern time, Search engine came into the life of everybod...
阅读(326) 评论(0)

HDU3746Cyclic Nacklace(KMP 求循环节)

Cyclic Nacklace Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 10367 Accepted Submission(s): 4438 Problem Description CC always becomes very depressed at the end of this month, he has checked...
阅读(443) 评论(0)

SER2016 DIV1 问题 H: Paint(区间问题贪心+dp优化)

问题 H: Paint 时间限制: 1 Sec 内存限制:128 MB 提交: 38 解决: 9 [提交][状态][讨论版] 题目描述 You are painting a picket fence with n slats, numbered from 1 to n. There are k painters willing to paint a specific portion of the fence. However, they don’t like each other, and each...
阅读(454) 评论(0)
22条 共5页1 2 3 4 5 ... 下一页 尾页
    个人资料
    • 访问:41944次
    • 积分:1791
    • 等级:
    • 排名:千里之外
    • 原创:125篇
    • 转载:9篇
    • 译文:0篇
    • 评论:28条
    博客专栏
    最新评论