摘要:
将罗穗骞论文《后缀数组--处理字符串的有力工具》中的实现修改后的版本。 注意: 1.s[ ]数组的末尾必须补一个“0”,这里“0”的含义是:比s[ ]中其他元素都小的一个值。因而函数 的参数 n 是 s[ ] 的实际长度再加 1 . 2.由于s[ ]的末尾补了零,必然有: sa[0]=n (0-in 阅读全文
摘要:
传送门 Solution: 记一颗流星在视野内的时间段为(L, R), 为了使所有(L, R)都取整数,首先将坐标放大。 放大倍数可取为 LCM(1, 2, ..., 10)= 2520 接着计算:从0时刻开始,每单位时间内入画的流星数,即数组: a[0], ..., a[M] 显然这可借助线段树, 阅读全文
摘要:
Summary of Chapter 33 STL Iterators from The C++ Programming Language 4th. Ed., Bjarne Stroustrup. The reason that STL containers and algorithms work 阅读全文
摘要:
传送门 Given an integer n, for all integers not larger than n, find the integer with the most divisors. If there is more than one integer with the same n 阅读全文
摘要:
传送门 time limit per test 4 seconds memory limit per test 256 megabytes input standard input output standard output Little Petya is now fond of data com 阅读全文
摘要:
time limit per test 1 second time limit per test 1 second memory limit per test 256 megabytes memory limit per test 256 megabytes input standard input 阅读全文
摘要:
传送门 time limit per test 3 seconds memory limit per test 256 megabytes input standard input output standard output Watchmen are in a danger and Doctor 阅读全文
摘要:
LINK time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output The teacher gave Anton a large geome 阅读全文
摘要:
传送门 Time Limit: 3000MS Memory Limit: 65536K Case Time Limit: 1000MS Special Judge Description Bill is developing a new mathematical theory for human e 阅读全文
摘要:
传送门 Description We often use the matrix to analyze reality models. There are lots of algorithm about matrix in Linear Algebra like matrix multiplicati 阅读全文