글 읽기 - 테스트 케이스가 맞는데 틀리다고 뜨네요;;

jjhhyy2005 4년 전 0

테스트 케이스도 되는데;; 틀렸다고 하네요.

#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<algorithm>
#include<math.h>

using namespace std;

int arr[100001] = { 0 };
int Max_Tree[200001] = { 0 };
int Min_Tree[200001] = { 0 };

int make_Max_Tree(int start,int end,int n);
int make_Min_Tree(int start, int end, int n);
int max_value_function(int start, int end, int n,int left,int righr);
int min_value_function(int start, int end, int n, int left, int right);

int main() {
	int n, m,a,b;
	scanf("%d %d", &n, &m);
	for (int i = 0; i < n; i++) {
		scanf("%d", &arr[i]);
	}
	make_Max_Tree(0, n - 1, 1);
	make_Min_Tree(0, n - 1, 1);
	for (int j = 0; j < m; j++) {
		scanf("%d %d", &a, &b);
		printf("%d ",min_value_function(0, n - 1, 1, a - 1, b - 1));
		printf("%d\n",max_value_function(0, n - 1, 1, a - 1, b - 1));
	}
	return 0;
}

int make_Max_Tree(int start, int end, int n) {
	if (start == end) {
		Max_Tree[n] = arr[start];
		return Max_Tree[n];
	}
	Max_Tree[n] = max(make_Max_Tree(start, (start + end) / 2, n * 2), make_Max_Tree((start + end) / 2 + 1, end, n * 2 + 1));
	return Max_Tree[n];
}
int make_Min_Tree(int start, int end, int n) {
	if (start == end) {
		Min_Tree[n] = arr[start];
		return Min_Tree[n];
	}
	Min_Tree[n] = min(make_Min_Tree(start, (start + end) / 2, n * 2), make_Min_Tree((start + end) / 2 + 1, end, n * 2 + 1));
	return Min_Tree[n];
}
int max_value_function(int start, int end, int n, int left, int right){
	if (right < start || left > end) return 0;
	if (start >= left && start <= right && end >= left && end <= right) {
		return Max_Tree[n];
	}

	return max(max_value_function(start, (start + end) / 2, n * 2, left, right), max_value_function((start + end) / 2 + 1, end, n * 2 + 1, left, right));
}
int min_value_function(int start, int end, int n, int left, int right){
	if (right < start || left > end) return 1000000001;
	if (start >= left && start <= right && end >= left && end <= right) {
		return Min_Tree[n];
	}

	return min(min_value_function(start, (start + end) / 2, n * 2, left, right), min_value_function((start + end) / 2 + 1, end, n * 2 + 1, left, right));
}