UVa 11364 - Parking (linear scan to get l & r, answer = 2*(r-l))

Link: https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=25&page=show_problem&problem=2349
Lời giải:

#include <iostream>
	#include <cstdio>
	using namespace std;
	int main()
	{
	int T, numStore, min, max, temp;
	cin >> T;
	while (T--)
	{
	min = 99; max = 0;
	cin >> numStore;
	for (int i = 0; i < numStore; ++i)
	{
	scanf("%d", &temp);
	if (temp < min)
	min = temp;
	if (temp > max)
	max = temp;
	}
	printf("%d\n", (max - min) * 2);
	}
	}