Dan has a list of problems suitable for Assignment 4. The difficulties of these problems are stored in a list of integers a. The i" problem's difficulty is represented by a[i] (the higher the integer, the more difficult the problem). Dan is too busy eating saltines to worry about Assignment 4 decisions, so he asks Michael the TA to select at least two problems from the list for the assignment. Since there are many possible subsets of the problems to consider and Michael has a life, he decides to consider only sublists (definition follows) of the list of problems. Moreover, he doesn't want the problems in the assignment to vary too much in difficulty (he finds it harder to grade the problems when that happens). 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 problems? 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 q1.py. Input The input consists of a single line containing the integers in the list a separated by single spaces. Output Output a single integer: the smallest difference in difficulties Michael can achieve.
Dan has a list of problems suitable for Assignment 4. The difficulties of these problems are stored in a list of integers a. The i" problem's difficulty is represented by a[i] (the higher the integer, the more difficult the problem). Dan is too busy eating saltines to worry about Assignment 4 decisions, so he asks Michael the TA to select at least two problems from the list for the assignment. Since there are many possible subsets of the problems to consider and Michael has a life, he decides to consider only sublists (definition follows) of the list of problems. Moreover, he doesn't want the problems in the assignment to vary too much in difficulty (he finds it harder to grade the problems when that happens). 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 problems? 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 q1.py. Input The input consists of a single line containing the integers in the list a separated by single spaces. Output Output a single integer: the smallest difference in difficulties Michael can achieve.
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
Related questions
Question
In python
![Dan has a list of problems suitable for Assignment 4. The difficulties of these
problems are stored in a list of integers a. The i" problem's difficulty is
represented by a [i] (the higher the integer, the more difficult the problem).
Dan is too busy eating saltines to worry about Assignment 4 decisions, so he asks
Michael the TA to select at least two problems from the list for the assignment.
Since there are many possible subsets of the problems to consider and Michael
has a life, he decides to consider only sublists (definition follows) of the list of
problems. Moreover, he doesn't want the problems in the assignment to vary too
much in difficulty (he finds it harder to grade the problems when that happens).
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 problems?
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 q1.py.
Input
The input consists of a single line containing the integers in the list a separated by
single spaces.
Output
Output a single integer: the smallest difference in difficulties Michael can
achieve.
Constraints](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fd9560cc0-8b67-4312-a65d-776a1b7bd6fa%2F649b256a-0706-4a6f-8d46-253236c22032%2F0qf4o8s_processed.png&w=3840&q=75)
Transcribed Image Text:Dan has a list of problems suitable for Assignment 4. The difficulties of these
problems are stored in a list of integers a. The i" problem's difficulty is
represented by a [i] (the higher the integer, the more difficult the problem).
Dan is too busy eating saltines to worry about Assignment 4 decisions, so he asks
Michael the TA to select at least two problems from the list for the assignment.
Since there are many possible subsets of the problems to consider and Michael
has a life, he decides to consider only sublists (definition follows) of the list of
problems. Moreover, he doesn't want the problems in the assignment to vary too
much in difficulty (he finds it harder to grade the problems when that happens).
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 problems?
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 q1.py.
Input
The input consists of a single line containing the integers in the list a separated by
single spaces.
Output
Output a single integer: the smallest difference in difficulties Michael can
achieve.
Constraints
![Constraints
• 2s len(a) s5 × 105
• 1s a[i] s 109
Time Limit
• Your program has to finish running within 2 seconds on any valid input.
Sample Input 1
10 6 9 1
Sample Output 1
3
Sample 1 Explanation
• If Michael selects all of the problems, 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.
Sample Input 2
777
Sample Output 2](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fd9560cc0-8b67-4312-a65d-776a1b7bd6fa%2F649b256a-0706-4a6f-8d46-253236c22032%2F9hhviwa_processed.png&w=3840&q=75)
Transcribed Image Text:Constraints
• 2s len(a) s5 × 105
• 1s a[i] s 109
Time Limit
• Your program has to finish running within 2 seconds on any valid input.
Sample Input 1
10 6 9 1
Sample Output 1
3
Sample 1 Explanation
• If Michael selects all of the problems, 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.
Sample Input 2
777
Sample Output 2
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 2 steps
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Recommended textbooks for you
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education