Brandon has a list of quizzes suitable for Assignment 1. The difficulties of these quizzes are...

Transcribed Image Text:

Brandon has a list of quizzes suitable for Assignment 1. The difficulties of these quizzes are stored in a list of integers a. The i-th problem's difficulty is represented by a [i] (the higher the integer, the more difficult the problem). Brandon is too busy working on other projects to work on assignment 1 decisions, so he asks Chris to select at least two quizzes from the list for the assignment. Since there are many possible subsets of the quizzes to consider and Chris has no time, he decides to consider only sublists (definition follows) of the list of quizzes. To make grading the assignment easier, Chris wants to pick quizzes that don't vary too much in difficulty. What is the smallest difference between the difficulties of the most difficult selected problem and the least difficult selected problem he can achieve by selecting a sublist of length at least 2 of the original list of quizzes? Time Limit Your program must finish running on any valid input within 3 seconds. Sample Input 1 10 6 9 1 Sample Output 1 3 Sample 1 Explanation If Chris selects all of the quizzes, the maximum difficulty would be 10 and the minimum difficulty would be 1. In this case, the difference he wants to minimize would be 9. If he selects the sublist 6 9, the maximum and minimum difficulties would be 9 and 6 respectively and the difference would be 3. Note that he can't select 10 9, as that's not a sublist of a. Definition: A sublist of a list a is any list you can obtain by removing some (possibly o) elements from the start of a and then removing some (possibly o) elements from the end of it. (It's like the definition of segment from lecture.). Filename Your filename for this question must be ql.py. Input The input consists of a single line containing the integers in the list a, separated by single spaces. Output Print a single integer indicating the smallest difference in difficulties Chris can achieve. Constraints 2 Sample Input 2 7 7 7 Sample Output 2 0 Brandon has a list of quizzes suitable for Assignment 1. The difficulties of these quizzes are stored in a list of integers a. The i-th problem's difficulty is represented by a [i] (the higher the integer, the more difficult the problem). Brandon is too busy working on other projects to work on assignment 1 decisions, so he asks Chris to select at least two quizzes from the list for the assignment. Since there are many possible subsets of the quizzes to consider and Chris has no time, he decides to consider only sublists (definition follows) of the list of quizzes. To make grading the assignment easier, Chris wants to pick quizzes that don't vary too much in difficulty. What is the smallest difference between the difficulties of the most difficult selected problem and the least difficult selected problem he can achieve by selecting a sublist of length at least 2 of the original list of quizzes? Time Limit Your program must finish running on any valid input within 3 seconds. Sample Input 1 10 6 9 1 Sample Output 1 3 Sample 1 Explanation If Chris selects all of the quizzes, the maximum difficulty would be 10 and the minimum difficulty would be 1. In this case, the difference he wants to minimize would be 9. If he selects the sublist 6 9, the maximum and minimum difficulties would be 9 and 6 respectively and the difference would be 3. Note that he can't select 10 9, as that's not a sublist of a. Definition: A sublist of a list a is any list you can obtain by removing some (possibly o) elements from the start of a and then removing some (possibly o) elements from the end of it. (It's like the definition of segment from lecture.). Filename Your filename for this question must be ql.py. Input The input consists of a single line containing the integers in the list a, separated by single spaces. Output Print a single integer indicating the smallest difference in difficulties Chris can achieve. Constraints 2 Sample Input 2 7 7 7 Sample Output 2 0