javatest

/*22)
* 28/07/11
* input a max of 20 nos
* print longest monotonic increasing and longest monotonic decreasing sequence
*/
import java.io.*;
public class LSequence
{
int ar[];
BufferedReader in=new BufferedReader(new InputStreamReader(System.in));
LSequence()
{}
LSequence(int n)
{
ar=new int[n];
}
void input()throws IOException
{
System.out.println("enter the no's");
for(int i=0;iar[i+1])
ret=true;
return ret;
}
int[] MaxSeries(int n)
{
int temp[]=new int[20],i=0,j=0,t[]=new int[0];
while(i20||n<1)
System.out.println("max value of n is 20 / invalid input");
else
{
ob.input();
System.out.println("\u000cOriginal array:");
ob.display(ob.ar);
System.out.println("longest monotonic increasing sequence:");
int Series1[]=ob.MaxSeries(1);
ob.display(Series1);
System.out.println("longest monotonic decreasing sequence:");
int Series2[]=ob.MaxSeries(2);
ob.display(Series2);
}
}
}