摘要： http://www.geeksforgeeks.org/sort-elements-by-frequency-set-2/ 1 #include 2 #include 3 #include 4 #include 5 #include 6 #include 7 #include 8 #include 9 using namespace std;10 11 void printarray(int arr[], int n) {12 map S;13 for (int i = 0; i > T;18 for (map::iterator it = S.be... 阅读全文

摘要： http://www.geeksforgeeks.org/maximum-contiguous-circular-sum/ 1 #include 2 #include 3 #include 4 #include 5 #include 6 #include 7 #include 8 #include 9 using namespace std;10 11 bool allneg(int arr[], int n) {12 for (int i = 0; i 0) return false;14 }15 return true;16 }17 18 int ... 阅读全文

摘要： http://www.geeksforgeeks.org/largest-subarray-with-equal-number-of-0s-and-1s/ 1 #include 2 #include 3 #include 4 #include 5 #include 6 #include 7 #include 8 #include 9 using namespace std;10 11 void findsubarray(int arr[], int n) {12 map > S;13 int sum = 0;14 for (int i = 0; i (1... 阅读全文

摘要： http://www.geeksforgeeks.org/find-the-two-numbers-with-odd-occurences-in-an-unsorted-array/ 1 #include 2 #include 3 #include 4 #include 5 #include 6 #include 7 #include 8 #include 9 using namespace std;10 11 void printtwoodd(int arr[], int n) {12 int x = arr[0];13 for (int i = 1; i <... 阅读全文

摘要： http://www.geeksforgeeks.org/longest-monotonically-increasing-subsequence-size-n-log-n/ 1 #include 2 #include 3 #include 4 #include 5 #include 6 #include 7 #include 8 #include 9 using namespace std;10 11 int maxsum(int arr[], int n) {12 vector tail;13 tail.push_back(arr[0]);14 fo... 阅读全文

摘要： http://www.geeksforgeeks.org/find-the-minimum-distance-between-two-numbers/ 1 #include 2 #include 3 #include 4 #include 5 #include 6 #include 7 #include 8 #include 9 using namespace std;10 11 int mindis(int arr[], int n, int x, int y) {12 int pre = 0;13 while (arr[pre] != x && arr[pr... 阅读全文

摘要： http://www.geeksforgeeks.org/maximum-of-all-subarrays-of-size-k/ 1 #include 2 #include 3 #include 4 #include 5 #include 6 #include 7 #include 8 #include 9 using namespace std;10 11 void printKMax(int arr[], int n, int k) {12 deque S;13 S.push_back(0);14 for (int i = 1; i = arr[S.... 阅读全文

摘要： http://www.geeksforgeeks.org/given-an-array-arr-find-the-maximum-j-i-such-that-arrj-arri/ 1 #include 2 #include 3 #include 4 #include 5 #include 6 #include 7 #include 8 #include 9 using namespace std;10 11 int maxindexdiff(int arr[], int n) {12 vector L(n), R(n);13 L[0] = arr[0];14 ... 阅读全文

摘要： http://www.geeksforgeeks.org/maximum-sum-such-that-no-two-elements-are-adjacent/ 1 #include 2 #include 3 #include 4 #include 5 #include 6 #include 7 #include 8 #include 9 using namespace std;10 11 int maxsum(int arr[], int n) {12 int insum = arr[0];13 int exsum = 0;14 for (int i ... 阅读全文

摘要： http://www.geeksforgeeks.org/array-rotation/O(n), O(1) 1 #include 2 #include 3 #include 4 #include 5 #include 6 #include 7 #include 8 #include 9 using namespace std;10 11 int gcd(int a, int b) {12 return b == 0? a : gcd(b, a % b);13 }14 15 void leftrotate(int arr[], int d, int n) {16 ... 阅读全文