solve as soon as possible

Question

You are given a sorted (either in the increasing or in the decreasing order) sequence of numbers, ending with a -1. You can assume that are at least two numbers before the ending -1. 

Let us call the sequence x0 x1 ... xn -1.

You have to output the number of distinct elements in the sorted sequence.

Kindly do not use arrays in the code. 

Answer 1

didnt understand what you want the output to be

can you give an example?

Comments

Output should be the the no of elements, when we give input as -1.
If i have input as 2,4,5,6 and then i give input as -1. Output should be 4. The input here was in increasing order. But i need it for increasing and decreasing order.

Answer 2

explain the problem more clearly

Answer 3

#include <bits/stdc++.h>

using namespace std;

int lis( int arr[], int n )

{

int result = 0;

int lis[n];

for (int i = 0; i < n; i++ )

lis[i] = 1;

for (int i = 1; i < n; i++ )

for (int j = 0; j < i; j++ )

if ( arr[i] > arr[j] &&

lis[i] < lis[j] + 1)

lis[i] = lis[j] + 1;

for (int i = 0; i < n; i++ )

if (result < lis[i])

result = lis[i];

return result;

}

int minimumNumberOfDeletions(int arr[],

int n)

{

int len = lis(arr, n);

return (n - len);

}

int main()

{

int arr[] = {30, 40, 2, 5, 1,

7, 45, 50, 8};

int n = sizeof(arr) / sizeof(arr[0]);

cout << "Minimum number of steps = "

<< minimumNumberOfDeletions(arr, n);

return 0;

}