随笔分类 - 算法与数据结构
摘要:B. Jzzhu and Sequences time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Jzzhu has invented
阅读全文
摘要:Ultra QuickSort | Time Limit: 7000MS | | Memory Limit: 65536K | | Total Submissions: 72479 | | Accepted: 27197 | Description In this problem, you have
阅读全文
摘要:Oil Deposits | Time Limit: 1000MS | | Memory Limit: 10000K | | Total Submissions: 21879 | | Accepted: 11397 | Description The GeoSurvComp geologic sur
阅读全文
摘要:Til the Cows Come Home | Time Limit: 1000MS | | Memory Limit: 65536K | | Total Submissions: 76501 | | Accepted: 25456 | Description Bessie is out in t
阅读全文
摘要:1174 区间中最大的数 基准时间限制:1 秒 空间限制:131072 KB 分值: 0 难度:基础题 收藏 关注 描述 给出一个有N个数的序列,编号0 N 1。进行Q次查询,查询编号i至j的所有数中,最大的数是多少。 例如: 1 7 6 3 1。i = 1, j = 3,对应的数为7 6 3,最大
阅读全文
摘要:斐波那契数列增加了质因数分解的内容,并不算难…代码如下: c++ include include include include include include include include include include include include define ll long long d
阅读全文
摘要:聪明的木匠 题目来源: 河北大学算法艺术协会 基准时间限制:1 秒 空间限制:131072 KB 分值: 20 难度:3级算法题 收藏 关注 描述 一位老木匠需要将一根长的木棒切成N段。每段的长度分别为L1,L2,......,LN(1 include include include include
阅读全文
摘要:快速排序模版,代码如下: c++ include include include include include define ll long long using namespace std ; pairpartition( vector &a ,int l, int r ){ int less
阅读全文
摘要:代码鲁棒性较差,之后补充注释以及减少BUG增加可读性。
阅读全文

浙公网安备 33010602011771号