随笔分类 - Acm
摘要:~A题 A. Cards time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output There are n cards (n is even
阅读全文
摘要:Prince and PrincessInput: Standard Input Output: Standard Output Time Limit: 3 Seconds In an n x n chessboard, Prince and Princess plays a game. The s
阅读全文
摘要:Error Curves Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 4928 Accepted Submission(s): 1867 Pr
阅读全文
摘要:转自: http://blog.csdn.net/acdreamers/article/details/9989197 首先来说说三分的概念: 二分是把区间分为长度相等的两段,三分则是把区间分为长度相等的三段,进行查找,这样的查找称为三分查找,三分查找通 常用来迅速确定最值。 众所周知,二分算法的要
阅读全文
摘要:Sona Time Limit:5000MS Memory Limit:65535KB 64bit IO Format: Submit Status Practice NBUT 1457 Sona Submit Status Practice NBUT 1457 Appoint descriptio
阅读全文
摘要:小Z的袜子(hose) Time Limit:20000MS Memory Limit:265216KB 64bit IO Format:%lld & %llu Submit Status Practice HYSBZ 2038 小Z的袜子(hose) Submit Status Practice
阅读全文
摘要:网上百度了一发,这个算法是一个叫莫涛的大牛研究出来的 Orz~ 看了一些牛牛们的博客,也大概理解了这个算法。 先说这个算法的作用吧: 莫队算法能够在O(n^1.5)的复杂度内求出区间[L,R]中某一个数字出现的次数。但是操作是离线的,因为这个算法的就是根据这个性质来的。 如果我们已经知道了区间[L,
阅读全文
摘要:Network Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 4478 Accepted: 1292 Description Yixght is a manager of the company called SzqNetwor
阅读全文
摘要:Network Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 903 Accepted Submission(s): 379 Problem
阅读全文
摘要:Connections between cities Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 8857 Accepted Submis
阅读全文
摘要:Distance Queries Time Limit: 2000MS Memory Limit: 30000K Total Submissions: 11759 Accepted: 4157 Case Time Limit: 1000MS Description Farmer John's cow
阅读全文
摘要:How far away ? Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 11739 Accepted Submission(s): 432
阅读全文
摘要:对于一类题目,是一棵树或者森林,有多次查询,求2点间的距离,可以用LCA来解决。 这一类的问题有2中解决方法。第一种就是tarjan的离线算法,还有一中是基于ST算法的在线算法。复杂度都是O(n); 先介绍在线算法: 1) dfs: 对于图所示的树,我们从根节点1开始dfs,按照先序访问(不算完全的
阅读全文
摘要:Trade Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u Submit Status Practice HDU 3401 Trade Submit Status Practice HDU 3401 Appoi
阅读全文
摘要:转自 : http://www.cnblogs.com/ka200812/archive/2012/07/11/2585950.html 单调队列是一种严格单调的队列,可以单调递增,也可以单调递减。队首位置保存的是最优解,第二个位置保存的是次优解,ect。。。 单调队列可以有两个操作: 1、插入一个
阅读全文
摘要:Mike and Feet Time Limit:1000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u Submit Status Practice CodeForces 548D Mike and Feet Submit Status
阅读全文
摘要:Subsequence Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 5809 Accepted Submission(s): 1911 Pr
阅读全文
摘要:Max Sum of Max-K-sub-sequence Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u Submit Status Practice HDU 3415 Max Sum of Max-K-su
阅读全文
摘要:Passing the Message Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 547 Accepted Submission(s):
阅读全文
摘要:Aladdin and the Flying Carpet Time Limit:3000MS Memory Limit:32768KB 64bit IO Format:%lld & %llu Submit Status Practice LightOJ 1341 Aladdin and the F
阅读全文

浙公网安备 33010602011771号