I use set but TLE...

#include <iostream>
#include <set>

using namespace std;

int n, k;
int arr[1000001];
int max_[1000001];
int min_[1000001];

int main(){
	cin >> n >> k;
	set<int> m;
	for(int i = 0; i < k; i++){
		scanf("%d", &arr[i]);
		m.insert(arr[i]);
	}
	min_[0] = *(m.begin());
	max_[0] = *(m.rbegin());
	
	for(int i = k; i < n; i++){
		scanf("%d", &arr[i]);
		m.insert(arr[i]);
		m.erase(arr[i - k]);
		min_[i-k+1] = *(m.begin());
		max_[i-k+1] = *(m.rbegin());
	}

	for(int i = 0; i < n - k + 1; i++){
		cout << min_[i];
		if(i == n - k) continue;
		cout << " ";
	}
	cout << endl;
	for(int i = 0; i < n - k + 1; i++){
		cout << max_[i];
		if(i == n - k) continue;
		cout << " ";
	}
	cout << endl;

	return 0;
}

• Re:兄弟我和你一样。。 (0) gzw_02 2008-11-11 22:29:17