摘要： 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 ... 阅读全文