Super Mario Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Tota ...
Rabbit Kingdom Time Limit: MS Java Others Memory Limit: K Java Others Total Submission s : Accepted Submission s : Problem Description Long long ago, there was an ancient rabbit kingdom in the forest. ...
2013-11-09 22:33 0 2789 推薦指數:
Super Mario Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Tota ...
題意:一個有n個點,m條邊的無向圖,找出最短路中的兩個點的路徑最大值。 n次spfa求最短路,然后找出最大值即可,踩着時間線險過。。。 代碼: ...
Mex Time Limit: 15000/5000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)Total Submi ...
Caocao's Bridges Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others ...
題目鏈接 對這個知識不熟啊。。。。自己找了一篇論文,上邊一個題,貌似和這個差不多,誰知一點都不一樣,怎么也不理解如何通過更改a b之間的全部+1,通過樹狀數組中更新數組的a和b+1,來操作。。。。實在理解了不了,看了解題報告發現和論文上的題,不一樣啊。。。只需要insert ...
題目鏈接:http://acm.hdu.edu.cn/showproblem.php?pid=6534 Chika and Friendly Pairs Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 524288/524288 ...
Elevator Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total S ...
目錄 題意 題解 代碼 題意 給你n個數,然后m個區間查詢,求區間里滿足|ai-aj|<=k的對數(L<=i<j<=R) 題解 求出每一個數與其能滿足條件的數的范圍在哪個區間,故將ai離散化,再將ai-k、ai+k離散化,然后直接莫隊+樹狀數組 ...