zoukankan      html  css  js  c++  java
  • POJ3632 Optimal Parking

    终于刷到了简单题的最后一题!!马上就要开始新专题了!!

    这题很简单,ans=2(max-min)

    Optimal Parking
    Time Limit: 1000MS   Memory Limit: 65536K
    Total Submissions: 7583   Accepted: 4558

    Description

    When shopping on Long Street, Michael usually parks his car at some random location, and then walks to the stores he needs. Can you help Michael choose a place to park which minimises the distance he needs to walk on his shopping round? Long Street is a straight line, where all positions are integer. You pay for parking in a specific slot, which is an integer position on Long Street. Michael does not want to pay for more than one parking though. He is very strong, and does not mind carrying all the bags around.

    Input

    The first line of input gives the number of test cases, 1 ≤ t ≤ 100. There are two lines for each test case. The first gives the number of stores Michael wants to visit, 1 ≤ n ≤ 20, and the second gives their n integer positions on Long Street, 0 ≤ xi ≤ 99.

    Output

    Output for each test case a line with the minimal distance Michael must walk given optimal parking.

    Sample Input

    2
    4
    24 13 89 37
    6
    7 30 41 14 39 42

    Sample Output

    152
    70

    Source

     
     1 //oionster
     2 #include<cstdio>
     3 #include<cstdlib>
     4 #include<iostream>
     5 using namespace std;
     6 int main(){
     7     int i,j,n,t,max,min,ans,p;
     8     scanf("%d",&t);
     9     for(i=1;i<=t;i++){
    10         ans=max=0;
    11         min=200;
    12         scanf("%d",&n);
    13         for(j=1;j<=n;j++){
    14             scanf("%d",&p);
    15             if(p>max)max=p;
    16             if(p<min)min=p;
    17         }
    18         ans=2*(max-min);
    19         printf("%d
    ",ans);
    20     }
    21     return 0;
    22 }
    View Code
  • 相关阅读:
    Linux NFS服务器的安装与配置
    Genymotion加速下载虚拟镜像速度慢失败Connection timeout
    人脸识别的损失函数
    caffe服务器搭建血泪记录
    shell
    ZigZag Conversion
    SSH阅读笔记
    numpy数组扩展函数repeat和tile用法
    高效网络小结
    Bag of Tricks for Image Classification with Convolutional Neural Networks论文笔记
  • 原文地址:https://www.cnblogs.com/oimonster/p/4361399.html
Copyright © 2011-2022 走看看