Information is present in the screenshot and below. Based on that need help in solving the code for this problem in python. The time complexity has to be as less as possible (nlogn or n at best, no n^2). Apply dynamic programming. Do not use recursion/memoization. Make sure ALL test cases return expected outputs. Sample Input 0 4 4 1
Information is present in the screenshot and below. Based on that need help in solving the code for this problem in python. The time complexity has to be as less as possible (nlogn or n at best, no n^2). Apply dynamic programming. Do not use recursion/memoization. Make sure ALL test cases return expected outputs. Sample Input 0 4 4 1
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
100%
Information is present in the screenshot and below. Based on that need help in solving the code for this problem in python. The time complexity has to be as less as possible (nlogn or n at best, no n^2). Apply dynamic programming. Do not use recursion/memoization. Make sure ALL test cases return expected outputs.
Sample Input 0
4 4
1
2
3
4
0
1
2
3
Sample Output 0
1
3
7
15
Explanation 0
You are given the sequence 1,2,3,4.
F0 = A0 = 1
F1 = A1 + F0 = 2 + 1 = 3
F2 = A2 + F1 + F0 = 3 + 3 + 1 = 7
F3 = A3 + F2 + F1 + F0 = 4 + 7 + 3 + 1 = 15
The actual code
def solve(k,a): MOD = 1000000007 # compute and return answer here q, n = list(map(int,input().rstrip().split(" "))) a = [int(input().rstrip()) for i in range(n)] outs = [] for i in range(q): k = int(input().rstrip()) outs.append(solve(k,a)) print("{}".format("\n".join(list(map(str,outs))))) |
![There is a notorious sequence that grows too fast and too furiously. We can define it as follows:
Given a sequence A0, A₁,..., An-1.
Fn An if n = 0
=
Fr
=
= An +F; if n > 0
You must answer queries. For each query, k, you must output F. This number may be so fast and furious
that so print it mod (10⁹ + 7). See the sample input to see an example computation.
Input Format
Input begins with a line with two space-separated integers Q and N, indicating the number of queries and
the number of given values in the sequence.
N lines follow, the ith line containing a single integer Aį.
lines follow, each containing a query k.
Constraints
1≤Q≤ 3.105
1≤N ≤ 2.10³
0 <k < N
0 ≤ A ≤ 10⁹
Output Format
For each query, output a single line containing f(k) mod (10⁹ + 7).](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fef7c41bc-9ec8-4b0d-8392-fba4e5be0a35%2F3502f61a-0368-40f4-957e-fec9b85e738c%2Frkk90um_processed.png&w=3840&q=75)
Transcribed Image Text:There is a notorious sequence that grows too fast and too furiously. We can define it as follows:
Given a sequence A0, A₁,..., An-1.
Fn An if n = 0
=
Fr
=
= An +F; if n > 0
You must answer queries. For each query, k, you must output F. This number may be so fast and furious
that so print it mod (10⁹ + 7). See the sample input to see an example computation.
Input Format
Input begins with a line with two space-separated integers Q and N, indicating the number of queries and
the number of given values in the sequence.
N lines follow, the ith line containing a single integer Aį.
lines follow, each containing a query k.
Constraints
1≤Q≤ 3.105
1≤N ≤ 2.10³
0 <k < N
0 ≤ A ≤ 10⁹
Output Format
For each query, output a single line containing f(k) mod (10⁹ + 7).
Expert Solution
![](/static/compass_v2/shared-icons/check-mark.png)
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 3 steps with 1 images
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
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](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
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)](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
![Digital Fundamentals (11th Edition)](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
![Database System Concepts](https://www.bartleby.com/isbn_cover_images/9780078022159/9780078022159_smallCoverImage.jpg)
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)](https://www.bartleby.com/isbn_cover_images/9780134444321/9780134444321_smallCoverImage.gif)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
![Digital Fundamentals (11th Edition)](https://www.bartleby.com/isbn_cover_images/9780132737968/9780132737968_smallCoverImage.gif)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
![C How to Program (8th Edition)](https://www.bartleby.com/isbn_cover_images/9780133976892/9780133976892_smallCoverImage.gif)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
![Database Systems: Design, Implementation, & Manag…](https://www.bartleby.com/isbn_cover_images/9781337627900/9781337627900_smallCoverImage.gif)
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
![Programmable Logic Controllers](https://www.bartleby.com/isbn_cover_images/9780073373843/9780073373843_smallCoverImage.gif)
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education