原创 並查集之poj 1308
Is It A Tree?Crawling in process... Crawling failed Time Limit:1000MS Memory Limit:10000KB 64bit IO Format:
原创 線段樹之Find the minimum
Find the minimum Time Limit: 2 Sec Memory Limit: 128 MBSubmit: 90 Solved: 22 [Submit][Status][Web Board] Descriptio
原创 典型揹包問題
Bone Collector Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 10
原创 動規之hdu3905--Sleeping
hdu3905--Sleeping Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 125536/65536 K (Java/Others) Total Submission
原创 線段樹之poj 2777
Count Color Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 30727 Accepted: 9174 Description Chosen
原创 單調隊列之最大最小成員
poj2823_Sliding WindowCrawling in process... Crawling failed Time Limit:12000MS Memory Limit:65536KB 64bi
原创 揹包問題(poj2184)
Cow Exhibition Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u Description:
原创 hdu 2896 病毒侵襲
病毒侵襲 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 10592
原创 UVA 107 The Cat in the Hat
公式雖已推出,但當n=1 時需要特判,下面代碼中會提到 #include<cmath> #include<cstdio> #include<cstring> #include<iostream> #include<algorithm>
原创 樹狀數組
1、概述 樹狀數組(binary indexed tree),是一種設計新穎的數組結構,它能夠高效地獲取數組中連續n個數的和。概括說,樹狀數組通常用於解決以下問題:數組{a}中的元素可能不斷地被修改,怎樣才能快速地獲取連續幾個數的和? 2
原创 hdu 4919 Exclusive or
Exclusive or Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others) Total Submission(s)
原创 poj 3468 (線段樹區間更新及求和)
A Simple Problem with Integers Time Limit:5000MS Memory Limit:131072KB 64bit IO Format:%I64d & %I64u Submi
原创 hdu 1728 逃離迷宮
逃離迷宮 Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 13952
原创 poj 2362 Square
Square Time Limit: 3000MS Memory Limit: 65536K Total Submissions: 19541 Accepted: 6797 Description Given a set
原创 單調隊列+DP
烽火傳遞 Description 烽火臺又稱烽燧,是重要的防禦設施,一般建在險要處或交通要道上。一旦有敵情發生,白天燃燒柴草,通過濃煙表達信息:夜晚燃燒乾柴,以火光傳遞軍情。在某兩座城市之間有n個烽火臺,每個烽火臺發