fork(1) download
copy 
  1. /* -------------------------------- */
  2. /* Name: Aseem Chakrabarthy         */
  3. /* Institute: CU                    */
  4. /* Dept: CSE                        */
  5. /* Email: aseem.cse.cu@gmail.com    */
  6. /* -------------------------------- */
  7. #include <cstdio>
  8. #include<iostream>
  9. #include <algorithm>
  10. #include <vector>
  11. #include <queue>
  12. #include <cctype>
  13. #include <cstring>
  14. #include <string>
  15. #include <cstdlib>
  16. #include <cmath>
  17. #define M 10000000
  18. bool prime[M];
  19. typedef long long int ll;
  20. using namespace std;
  21. int main()
  22. {
  23.     int test,store,distance;
  24.     cin>>test;
  25.     while(test--)
  26.     {
  27.       cin>>store;
  28.       int max=0;
  29.       int min=99;
  30.       while(store--)
  31.       {
  32.           cin>>distance;
  33.           if(max<=distance)//Finding maximum distance;
  34.           {
  35.               max=distance;
  36.           }
  37.           if(min>=distance)//Finding minimum distance;
  38.           {
  39.               min=distance;
  40.           }
  41.       }
  42.       int minimum_distance=(max-min)*2;//This problem to say that minimum distance for car
  43.       //parking to different shop.He can only one park.so i guess that (max-min)*2 is the
  44.       // minimum distance.Here multiply by 2 because he 1 time go to shop and again back.
  45.        cout<<minimum_distance<<endl;
  46.     }
  47. }
  48.  
Success #stdin #stdout 0s 13224KB
comments (?)
stdin
copy 
2
4
24 13 89 37
6
7 30 41 14 39 42
stdout
copy 
152
70
https://ideone.com/e3Bl6x
language:
C++14 (clang 8.0)
created:
10 years ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!