THIS IS A TEST FOR LaTeX \( e=m c^2 \) $$\begin{pmatrix} a_{11} & \cdots & a_{1n}\\ \vdots & \ddots & \vdots\\ a_{m1} & \cdots & a_{mn} \end{pmatrix}$$ ...
好文章搜集
Bounce[2017 ACM 北京站网络赛]
题目7 : Bounce时间限制:1000ms 单点时限:1000ms 内存限制:256MB描述 For Argo, it is very interesting watching a circle bouncing in a rectangle.As shown in the figure below, th...
Hotel POJ – 3667 （线段树的区间更新）洛谷P2894 [USACO08FEB]
题目描述 The cows are journeying north to Thunder Bay in Canada to gain cultural enrichment and enjoy a vacation on the sunny shores of Lake Superior. Bessie, ever the competent travel agent, has ...
Just a Hook HDU – 1698 (线段树的区间更新)
Problem Description In the game of DotA, Pudge’s meat hook is actually the most horrible thing for most of the heroes. The hook is made up of several consecutive metallic sticks which are of the s...
A Simple Problem with Integers POJ – 3468(线段树的区间更新)
Time Limit: 5000MS Memory Limit: 131072KTotal Submissions: 118228 Accepted: 36755Case Time Limit: 2000MSDescriptionYou have N integers, A1, A2, ... , AN. Y...
I Count Two Three HDU – 5878 (打表+二分搜索+输入挂)
I will show you the most popular board game in the Shanghai Ingress Resistance Team. It all started several months ago. We found out the home address of the enlightened agent Icount2three...
Sticks Problem POJ – 2452 （线段树）
Sticks ProblemTime Limit: 6000MSMemory Limit: 65536KTotal Submissions: 10724Accepted: 2855DescriptionXuanxuan has n sticks of different length. One day, she pu...
基于ST表的RMQ算法
基于ST表的RMQ算法可以在O(1)的时间复杂度内计算出一个区间内的最值。基本思想是将一段长度中的最值保存下来。查询的时候直接返回。避免了常规算法中的一次一次比较的操作。详细请参考书籍：《算法竞赛入...
hdoj 5326 Work （简单并查集）
It’s an interesting experience to move from ICPC to work, end my college life and start a brand new journey in company. As is known to all, every stuff in a company has a title, everyo...
POJ 1426 Find The Multiple (神奇的打表da法）
DescriptionGiven a positive integer n, write a program to find out a nonzero multiple m of n whose decimal representation contains only the digits 0 and 1. You may assume that n is not greater ...