# A Simple Problem with Integers POJ – 3468(线段树的区间更新)

Time Limit: 5000MS Memory Limit: 131072K Total Submissions: 118228 Accepted: 36755 Case Time Limit: 2000MS Description You 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 Problem Time Limit: 6000MS Memory Limit: 65536K Total Submissions: 10724 Accepted: 2855 Description Xuanxuan has n sticks of different length. One day, she pu...

# 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法）

Description Given 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 ...

# [转]图的理论基础

https://wangkuiwu.github.io/2013/04/05/graph-thesis/   图的基本概念 1. 图的定义 定义：图(graph)是由一些点(vertex)和这些点之间的连线(edge)所组成的；其中，点通常被成为"顶点(vertex)"，而点与...

# Prim算法

https://www.cnblogs.com/skywang12345/p/3711506.html 普里姆算法介绍 普里姆(Prim)算法，和克鲁斯卡尔算法一样，是用来求加权连通图的最小生成树的算法。 基本思想 对于图G而言，V是所有顶点的集合；现在...