-
Notifications
You must be signed in to change notification settings - Fork 3
/
lightoj 1082.cpp
72 lines (50 loc) · 1.11 KB
/
lightoj 1082.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
#include<bits/stdc++.h>
using namespace std;
#define ma 500005
int a[ma],tree[4*ma];
int query(int node,int be,int en,int i,int j)
{
if(i>en||j<be)
return INT_MAX;
if(i<=be&&j>=en)
return tree[node];
int left=node*2;
int right=node*2+1;
int mid=(be+en)/2;
return min(query(left,be,mid,i,j),query(right,mid+1,en,i,j));
}
void inti(int node,int be,int en)
{
if(be==en)
{
tree[node]=a[be];
return;
}
int left=node*2;
int right=node*2+1;
int mid=(be+en)/2;
inti(left,be,mid);
inti(right,mid+1,en);
tree[node]=min(tree[left],tree[right]);
}
int main()
{
int t;
scanf("%d",&t);
for(int ii=1; ii<=t; ii++)
{
int n,q;
scanf("%d%d",&n,&q);
for(int i=1; i<=n; i++)
scanf("%d",&a[i]);
inti(1,1,n);
printf("Case %d:\n",ii);
while(q--)
{
int qq,qqq;
scanf("%d%d",&qq,&qqq);
printf("%d\n",query(1,1,n,qq,qqq));
}
}
return 0;
}