wang_128的博客

Query on the subtree                                                                 Time Limit: 16000/8000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)                       

Cube number on a tree                                                                Time Limit: 20000/10000 MS (Java/Others)    Memory Limit: 65535/65535 K (Java/Others)                       

BoatherdsTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 3049 Accepted: 1001DescriptionBoatherds Inc. is a sailing company operating in the country of

Distance StatisticsTime Limit: 2000MS Memory Limit: 64000KTotal Submissions: 2588 Accepted: 933Case Time Limit: 1000MSDescriptionFrustrated at the number

聪聪可可Time Limit: 3 Sec  Memory Limit: 259 MBSubmit: 3775  Solved: 1939[Submit][Status][Discuss]Description聪聪和可可是兄弟俩，他们俩经常为了一些琐事打起来，例如家中只剩下最后一根冰棍而两人都想吃、两个人都想玩儿电脑（可是他们家只有一台电脑）……遇到这种问题，一般情况下石头

TreeTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 24702 Accepted: 8256DescriptionGive a tree with n vertices,each edge has a length(positive integer

D Tree                                                               Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 102400/102400 K (Java/Others)

[HNOI2015]开店Time Limit: 70 Sec  Memory Limit: 512 MBSubmit: 1883  Solved: 811[Submit][Status][Discuss]Description 风见幽香有一个好朋友叫八云紫，她们经常一起看星星看月亮从诗词歌赋谈到人生哲学。最近她们灵机一动，打算在幻想乡开一家小店来做生意赚点钱。这样的

Close Verticestime limit per test5 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputYou've got a weighted tree, consisting of n 

Garden of Eden                                                                       Time Limit: 10000/5000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)                       

FTOUR2 - Free tour IIno tags After the success of 2nd anniversary (take a look at problem FTOUR for more details), this 3rd year, Travel Agent SPOJ goes on with another discount tour.T

[FJOI2014]最短路径树问题Time Limit: 5 Sec  Memory Limit: 512 MBSubmit: 1625  Solved: 565[Submit][Status][Discuss]Description给一个包含n个点，m条边的无向连通图。从顶点1出发，往其余所有点分别走一次并返回。往某一个点走时，选择总长度最短的路径走。若有多条长度最短

Shortest-path tree                                                                    Time Limit: 6000/3000 MS (Java/Others)    Memory Limit: 130712/130712 K (Java/Others)

Mart Master II                                                                 Time Limit: 12000/6000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)