1 solutions

  • 0
    @ 2025-11-5 17:55:39

    C :

    #include<stdio.h>
    #define INF 0x7fffffff
    int main()
    {
    	int t,max,min,n,a;
    	scanf("%d",&t);
    	while(t--)
    	{
    		scanf("%d",&n);
    		max=0,min=INF;
    		while(n--)
    		{
    			scanf("%d",&a);
    			if(a>max)max=a;
    			if(a<min)min=a;
    		}
    		printf("%d\n",2*(max-min));
    	}
    	return 0;
    }
    

    C++ :

    #include <stdio.h>
    
    int main() {
    	int t, n, p, maxi, mini;
    	scanf("%d", &t);
    	while (t--) {
    		scanf("%d", &n);
    		maxi = -100000000;
    		mini = 100000000;
    		while (n--) {
    			scanf("%d", &p);
    			if (p > maxi)
    				maxi = p;
    			if (p < mini)
    				mini = p;
    		}
    		printf("%d\n", (maxi - mini) * 2);
    	}
    	return 0;
    }
    

    Java :

    import java.util.*;
    
    public class Main{
     final static Scanner jin=new Scanner(System.in);
      public static void main(String args[]){
       int t=jin.nextInt();
        while(t-->0){
         int n=jin.nextInt();
          int m=jin.nextInt();
          int M=m;
          for(int i=1;i<n;i++){
           int x=jin.nextInt();
            if(x<m)m=x;
            if(x>M)M=x;
          }
          System.out.println(2*(M-m));
        }
      }
    }
    
    • 1

    Information

    ID
    18647
    Time
    1000ms
    Memory
    32MiB
    Difficulty
    (None)
    Tags
    # Submissions
    0
    Accepted
    0
    Uploaded By