Given a positive integer k, two exhibits are called k-comparative if:    they are completely expanding;    they have a similar length;    every one of their components are positive integers among 1 and k (comprehensive);    they vary in precisely one position.

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
icon
Related questions
Question

Correct answer will be upvoted else downvoted. Computer science.

 

 Given a positive integer k, two exhibits are called k-comparative if: 

 

they are completely expanding; 

 

they have a similar length; 

 

every one of their components are positive integers among 1 and k (comprehensive); 

 

they vary in precisely one position. 

 

You are given an integer k, a stringently expanding exhibit an and q inquiries. For each inquiry, you are given two integers li≤ri. Your assignment is to find the number of exhibits b exist, to such an extent that b is k-like cluster [ali,ali+1… ,ari]. 

 

Input 

 

The principal line contains three integers n, q and k (1≤n,q≤105, n≤k≤109) — the length of exhibit a, the number of questions and number k. 

 

The subsequent line contains n integers a1,a2,… ,an (1≤ai≤k). This cluster is totally expanding — a1<a2<… <an. 

 

Every one of the accompanying q lines contains two integers li, ri (1≤li≤ri≤n). 

 

Output 

 

Print q lines. The I-th of them ought to contain the response to the I-th inquiry

 

 

Expert Solution
steps

Step by step

Solved in 4 steps with 1 images

Blurred answer
Knowledge Booster
Dynamic Table
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.
Similar questions
Recommended textbooks for you
Database System Concepts
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)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education