ACM——折半枚举——降低时间复杂度
eeetttzhangji
这个作者很懒,什么都没留下…
展开
-
你是怎么学习的?
Can you find it? Time Limit: 10000/3000 MS (Java/Others) Memory Limit: 32768/10000 K (Java/Others) Problem Descrip转载 2017-03-28 00:21:30 · 355 阅读 · 0 评论 -
将n^4降低为logn*n^2
4 Values whose Sum is 0 Time Limit: 15000MS Memory Limit: 228000K Total Submissions: 21439 Accepted: 6454 Case Time Limit: 5000MS Description The SUM problem can原创 2017-03-25 21:36:05 · 355 阅读 · 0 评论