// Created By Nautash Ahmad // Link to thread in the comments section #include #include #include using namespace std; int main() { int size = 50; int arr[size] = {0}; srand(time(NULL)); for(int i = 0; i < size; i++) arr[i] = 1 + rand() % 10; cout << "Array having even and odd numbers\n"; for(int i = 0; i < size; i++) cout << arr[i] << " "; // This loop is used to get the longest sequence of even numbers and the ending index of sequence int maxLength = 0, count = 0, index = 0; for(int i = 0; i < size; i++) { if(arr[i] % 2 == 0) count++; else { index = (count > maxLength)? i : index; maxLength = (count > maxLength)? count : maxLength; count = 0; } } cout << "\n\nMax chain of longest element of even numbers is " << maxLength << " from index " << (index - maxLength) << " to index " << index - 1 << endl; // This loop will assign the value of zero(deleting) to each index of the sequence for(int i = 0; i < index; i++) { if(i >= (index - maxLength) && i <= (index - 1)) arr[i] = 0; } // Shifting the deleted elements to the end of the array for(int i = 0; i < size; i++) { for(int j = 0; j < size - 1; j++) { if(arr[j] == 0) { int temp = arr[j]; arr[j] = arr[j+1]; arr[j+1] = temp; } } } cout << "\n\nArray after removing longest chain of even numbers\n"; for(int i = 0; i < size; i++) cout << arr[i] << " "; return 0; }

[Q&A's] Removing longest chain of even elements from array