POJ 1195 Mobile phones(二維樹狀數組)
Mobile phones Time Limit: 5000MS Memory Limit: 65536K Total Submission
POJ 3660Cow Contest(並查集+拓撲排序)
Cow Contest Time Limit: 1000MS Memory Limit: 65536K Total Submissions:
POJ 3903 Stock Exchange (LIS模版題)
題目跟poj2533一樣,改一下數組大小完美A過。 #includeconst int N = 100001;int a[N], f[N]
HDU 4336 Card Collector(概率dp+狀壓)
Card CollectorTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/3
POJ 1351 Number of Locks (記憶化搜索 狀態壓縮)
Number of Locks Time Limit: 1000MS Memory Limit: 10000K Total Su
POJ 3723 Conscription (最大生成樹)
最大生成樹。。跟最小生成樹原理一樣。只是排序的順序改變了而已。代碼如下:#include #include #include #include #i
[Practical.Vim(2012.9)].Drew.Neil.Tip98 學習摘要
Delete Lines Containing a PatternCombining the :global and :delete commands allo
poj 2537 Tight words 概率dp
分析:用計數dp思想:DP[I][J]=(DP[I-1][J-1]+DP[I-1][J]+DP[I-1][J+1]),最後再除pow(k+1,n)容易爆精度,改