public class alg {
public static void main(String[] args) {
int [] L={1,2,3,23,25,4,5,6,26};
int [] T = new int [L.length];
T[0]=1;
int max;
for (int j = 1; j < L.length; j++) {
max=0;
for (int k = 0; k < j; k++) {
if (L[j]>L[k]){
max=1+T[k];
}
}
if (max>0) {
T[j]=max;
}
else {
for (int k = 0; k < j; k++){
if (T[k]>max){
max=T[k];
}
}
T[j]=max;
}
}
max=0;
int pos=0;
for (int i = 0; i < T.length; i++) {
if (T[i]>max){
max=T[i];
pos=i;
}
}
System.out.print(L[pos]+" , ");
for (int i = pos-1; i >=0; i--) {
//System.out.println(max);
//System.out.println(T[i]-1);
if (max==T[i]+1){
//System.out.println(i);
max=T[i];
System.out.print(L[i]+" , ");
//System.out.println(max);
}
}
}
}