Kattis Challenge "Parking"
“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.”
Problem
My solution
import java.util.Scanner;
public class Parking {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int t = sc.nextInt();
for (int i = 0; i < t; i++) {
int n = sc.nextInt();
int high = 0;
int low = 100;
int d = 0;
for (int j = 0; j < n; j++) {
int s = sc.nextInt();
if (s > high) {
high = s;
}
if (s < low) {
low = s;
}
d = (high - low) * 2;
}
System.out.println(d);
}
}
}
Related Reading
Related entries
Selected from shared tags, categories, and nearby entries in the same section.
Troubleshooting N-Central Take Control
Steps to take when N-Central’s Take Control remote access feature isn’t working, including how to restart the necessary services.
k-means Clustering
A Processing visualization of the k-means clustering algorithm, demonstrating iterative centroid-based data partitioning and Voronoi cell formation for different values of k.
Blending Textures With Open Simplex Noise
A Processing implementation that combines Open Simplex Noise with image blending techniques to create smooth, organic animations of texture transitions.
Cube Wave
A Processing implementation of a 3D cube wave animation using PeasyCam for camera control, featuring dynamic lighting and orthographic projection for a mesmerizing visual effect.
