A. Prefix range

subject

Ideas

This question is relatively simple , Directly traversing a given n An integer , Just write it down directly in front of i Maximum and minimum values for nodes , And before writing it down i Extreme value of nodes , Finally, you can give it when you ask .

Code

#include<stdio.h>
int main()
{
	int n,q;
	int a[150000];
	int flag[150000];
	scanf("%d %d",&n,&q);
	scanf("%d",&a[0]);
	int max=a[0],min=a[0];
	flag[1]=max-min;
	for(int i=1;i<n;i++){
		scanf("%d",&a[i]);
		if(a[i]>max){
			max=a[i];
		}
		if(a[i]<min){
			min=a[i];
		} 
		flag[i+1]=max-min;
	}
	int x;
	q--;
	scanf("%d",&x);
	printf("%d",flag[x]); 
	while(q--){
		scanf("%d",&x);
		printf(" %d",flag[x]); 
	}
	
 }