原创 O(n)迴文子串（Manacher）算法
迴文子串 問題描述： 輸入一個字符串，求出其中最大的迴文子串。子串的含義是：在原串中連續出現的字符串片段。迴文的含義是：正着看和倒着看相同，如abba和yyxyy。 解析： 這裏介紹O(n)迴文子串（Manacher）算法 算法基本
2018-09-03 13:55:27
原创 二分最大匹配--匈牙利算法
二分最大匹配--匈牙利算法 匈牙利算法是由匈牙利數學家Edmonds於1965年提出，因而得名。匈牙利算法是基於Hall定理中充分性證明的思想，它是部圖匹配最常見的算法，該算法的核心就是尋找增廣路徑，它是一種用增廣路徑求二分圖最大匹
2018-09-03 13:55:27
原创 The Water Problem RMQ區間最大值
The Water Problem Time Limit: 1500/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others) Total Submissio
2018-09-03 13:55:27
原创 區間最小值 LightOJ - 1082 RMQ 線段樹
區間最小值 LightOJ - 1082 Given an array with N elements, indexed from 1 to N. Now you will be given some queries in the
2018-09-03 13:55:27
原创 Just a Hook ，線段樹，區間更新 ，區間求和
Just a Hook Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 35
2018-09-03 13:55:27
原创 敵兵佈陣 樹狀數組 單點更新 區間求和
敵兵佈陣 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 98822
2018-09-03 13:55:27
原创 Billboard 線段樹
Billboard Time Limit: 20000/8000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 244
2018-09-03 13:55:27
原创 A/B 乘法逆元
A/B Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 6592 Ac
2018-09-03 13:55:27
原创 Balanced Lineup 線段樹 RMQ
Balanced Lineup Time Limit: 5000MS Memory Limit: 65536K Total Submissions: 56032 Accepted: 26268 Case Time Limit: 2
2018-09-03 13:55:27
原创 Frequent values RMQ
Frequent values You are given a sequence of n integers a1 , a2 , ... , an in non-decreasing order. In addition to th
2018-09-03 13:55:27
原创 Balanced Lineup 線段樹 rmq 區間最值
Balanced Lineup For the daily milking, Farmer John's N cows (1 ≤ N ≤ 50,000) always line up in the same order. One d
2018-09-03 13:55:27
原创 I Hate It 樹狀數組 單點更新 區間最大值
I Hate It Time Limit: 9000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 8277
2018-09-03 13:55:27
原创 Minimum Inversion Number 樹狀數組
Minimum Inversion Number Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Subm
2018-09-03 13:55:27
3
原创 Combinations 乘法逆元
G - Combinations Given n different objects, you want to take k of them. How many ways to can do it? For example,
2018-09-03 13:55:27
原创 素數判定
素數判定 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 141829
2018-09-03 13:55:27