Quantcast
Viewing all articles
Browse latest Browse all 39796

LISA problem unsolved..

import java.util.Scanner;

import java.io.*;

class lisa{

    public static long list[];
    public static void main(String[] args) throws IOException{

        BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
        int t=Integer.parseInt(br.readLine());

        for(int l1=0;l1<t;l1++){

        int n =Integer.parseInt(br.readLine());

        list=new long[n];

        String s=br.readLine();
        String str[]=s.split(" ");
         long arr[]=new long[n];

        for(int i=0;i<n;i++){
            arr[i]=Long.parseLong(str[i]);
            list[i]=1;
        }
        list_find(arr,n);
        long max=0;
        for(int i=0;i<n;i++){
            if(max<list[i])
                max=list[i];
        }
        long max1=0;
        for(int i=0;i<n;i++){
            if(list[i]==max){
                if(max1<arr[i])
                    max1=arr[i];
            }   
        }
        long min=list[0];

        long min1=10000000000000L;
        for(int i=0;i<n;i++){
            if(list[i]==min){
                if(min1>arr[i])
                    min1=arr[i];
            }   
        }

        if(min==max)
            System.out.println(0);
        else
            System.out.println(max1-min1);
        }
    }

    public static void list_find(long arr[],int len){
        for(int i=1;i<len;i++){
            for(int j=0;j<i;j++){
                if(arr[j]<arr[i] && list[i]<list[j]+1)
                    list[i]=list[j]+1;
            }   
        }   
    }
}

Viewing all articles
Browse latest Browse all 39796

Trending Articles



<script src="https://jsc.adskeeper.com/r/s/rssing.com.1596347.js" async> </script>