2017年10月_zzcblogs

12月 11月 10月 09月 08月 07月 06月 05月 04月

原创 HUD-3308 LCIS 线段树(区间合并)

LCIS Time Limit: 6000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 8005 Accepted Submission(s): 3414 Problem Description Given n integers. Yo

2017-10-13 16:30:19 247

原创 UVA 12655 Trucks(MST + LCA)

uva 12655 Trucks [LCA]（树链剖分+MST） The Subtle Balloons Company (SBC) is the main balloon provider for programming contests; it has huge factories and warehouses, as well as an extensive truck

2017-10-12 12:11:20 293

原创 HDU 3966 Aragorn's Story （树链剖分区间更新，点查询）

Problem Description Our protagonist is the handsome human prince Aragorn comes from The Lord of the Rings. One day Aragorn finds a lot of enemies who want to invade his kingdom. As Aragorn knows, t

2017-10-10 19:07:26 245

原创 2016 Europe - Northwestern I - Iron and Coal UVALive - 7767（最短路）

There are many excellent strategy board games, and yourfavourite among them is called “Steel Age”. It o ers manydi erent paths to victory but you prefer the blood-and- re-strategy: build as many sol

2017-10-08 13:37:10 353

原创 2016ACM/ICPC亚洲区青岛站 G - Coding Contest (最小费用最大流)

A coding contest will be held in this university, in a huge playground. The whole playground would be divided into N blocks, and there would be M directed paths linking these blocks. The i-th path goe

2017-10-08 10:42:16 807

原创 bzoj 1036 ZJOI2008 树的统计count （树链剖分

1036: [ZJOI2008]树的统计Count Time Limit: 10 Sec Memory Limit: 162 MB Submit: 3401 Solved: 1418 [Submit][Status] Description 一棵树上有n个节点，编号分别为1到n，每个节点都有一个权值w。我们将以下面的形式来要求你对这棵树完成一些操作： I. CHANGE u

2017-10-06 09:58:05 278

Machine Learning-A Probabilistic Perspective.

。

2017-06-04

空空如也

TA创建的收藏夹 TA关注的收藏夹

TA关注的人