/*Longest Sequence Given a series of numbers, find the longest sequence in the series. A sequence could be one of the following: An ascending sequence Example: Input: 836926 Output: 369 A descending sequence Example: Input: 2995316 Output: 9531 An equal sequence Example: Input: 255566 Output: 555 Input : series of numbers (string) output: print longest ascending, descending & equal sequence. */ #include #include using namespace std; int main() { // take string as input string strInput; cin >> strInput; //number validation if(strInput.find_first_not_of("0123456789")!=string::npos) { cout << "please enter numerics only"; return 0; } //Size of input int intTotal = strInput.size(); // user entered value cout << " You have entered : "<< strInput << endl; //declaration for output int intAsc_start = 0; int intAsc_Cnt = 0; int intDes_start = 0; int intDes_Cnt = 0; int intEqu_start = 0; int intEqu_Cnt = 0; //loop through all digits for(int i=0;i=strInput[j] && !isAscFailed)//fail for ascending { intTempAsc_Cnt = j - i; isAscFailed = true; } if(strInput[j-1]<=strInput[j] && !isDesFailed)//fail for descending { intTempDes_Cnt = j - i; isDesFailed = true; } if(strInput[j-1]!=strInput[j] && !isEquFailed)//fail for equal { intTempEqu_Cnt = j - i; isEquFailed = true; } } //update ascending if(intTempAsc_Cnt>intAsc_Cnt) { intAsc_start = i; intAsc_Cnt = intTempAsc_Cnt ; } //update descending if(intTempDes_Cnt>intDes_Cnt) { intDes_start = i; intDes_Cnt = intTempDes_Cnt ; } //update equal if(intTempEqu_Cnt>intEqu_Cnt) { intEqu_start = i; intEqu_Cnt = intTempEqu_Cnt ; } } // cout ascending string cout << "Ascending Sequence is " << strInput.substr(intAsc_start,intAsc_Cnt) << endl; // cout desscending string cout << "Descending Sequence is " << strInput.substr(intDes_start,intDes_Cnt) << endl; // cout equal string cout << "Equal Sequence is " << strInput.substr(intEqu_start,intEqu_Cnt) << endl; return 0; }

LongestQueue