findlongestsequence

//joanna wilbur
import java.util.*;
public class proj6q8
{
	public static void main(String[]args)
	{
		Scanner input = new Scanner(System.in);
		int [] UsersArray = new int[100];
		int ArraySize;
		
		System.out.println("How many integers are in the sequence?");
		ArraySize=input.nextInt();
		
		System.out.println("Enter an array and stop using -999.");
		for (int i=0; i<ArraySize; i++)
		{
			UsersArray [i]=input.nextInt();
			if (UsersArray [i]== -999)
				break;
		}//end for loop
		FindSubsequence(ArraySize, UsersArray);
	}//end main
	public static int FindSubsequence(int ArraySize, int UsersArray [])
	{
		Scanner input = new Scanner(System.in);
		int max=0, maxStart, maxEnd;
		
		for (int x=0; x<ArraySize; x++)
			{
				maxStart=x;
				for (int j=0;UsersArray[x]<UsersArray[j]; j++)
				{
					maxEnd=j;
				}
				for (int i=maxStart; i==maxEnd; i++)
					System.out.println("Longest sequence is " + UsersArray[i]);
			}
		return max;
	}// end FindSubsequence
}//end class