问题 H: Tallest Cow

时间限制: 1.000 Sec  内存限制: 128 MB
提交 状态

题目描述

FJ's N (1 ≤ N ≤ 10,000) cows conveniently indexed 1..N are standing in a line. Each cow has a positive integer height (which is a bit of secret). You are told only the height H (1 ≤ H ≤ 1,000,000) of the tallest cow along with the index I of that cow.
FJ has made a list of R (0 ≤ R ≤ 10,000) lines of the form "cow 17 sees cow 34". This means that cow 34 is at least as tall as cow 17, and that every cow between 17 and 34 has a height that is strictly smaller than that of cow 17.
For each cow from 1..N, determine its maximum possible height, such that all of the information given is still correct. It is guaranteed that it is possible to satisfy all the constraints.

输入

Line 1: Four space-separated integers: N, I, H and R 
Lines 2..R+1: Two distinct space-separated integers A and B (1 ≤ A, B ≤ N), indicating that cow A can see cow B.

输出

Lines 1..N: Line i contains the maximum possible height of cow i.

样例输入 Copy

9 3 5 5
1 3
5 3
4 3
3 7
9 8

样例输出 Copy

5
4
5
3
4
4
5
5
5

真的好菜啊我，wa了一晚上，最后发现有可能出现重复的情况， 所以说需要一个map<pair<int,int>,bool>来去重，这道题目的思路是把a和b之间所有的牛的高度都减一，这就是一个典型的的差分问题， 所以需要前缀和加差分加map来处理一次啊.注意是a和b牛之间的，不包括a和b！！！！

首先展示一下错误的代码：

#include <iostream>
#include <string>

#define endl "\n"
using namespace std;


typedef long long int ll;
const int N = 1e05  + 10;

int q[N]; // 储存前缀和
int st[N]; //储存差分

inline int read() {
	int s = 0, w = 1;
	char ch = getchar();
	while (ch < '0'|| ch > '9') {
		if (ch == '-') {
			w = -1;
			ch = getchar();
		}
	}
	while (ch >= '0' && ch <= '9') {
		s = s * 10 + ch - '0';
		ch = getchar();
	}
	return s * w;
}

void get_change(int l, int r) {
	q[r + 1] += 1;
	q[l] -= 1;
}

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie();
	cout.tie();
	
	int n, l, H, _;
	n = read();
	l = read();
	H = read();
	_ = read();
	
	while (_ --) {
		int a, b;
		a = read();
		b = read();
		
		if (a > b) swap(a, b);
		if (a + 1 == b) continue;
		get_change(a + 1, b - 1);
	}
	for (int i = 1; i <= n; i++) {
		q[i] += q[i - 1];
		cout << q[i] + H<< endl;
	}
	
	return 0;
}

然后是a的

#include <iostream>
#include <algorithm>
#include <map>
#include <cstring>

#define endl "\n"
using namespace std;
const int N = 1e05 + 10;

inline int read() {
	char ch = getchar();
	int s = 0, w = 1;
	while (ch < '0' || ch > '9') {
		if (ch == '-') {
			w = -1;
			ch = getchar();
		}
	}
	while (ch >= '0' && ch <= '9') {
		s = s * 10 + ch - '0';
		ch = getchar();
	}
	return s * w;
}

map<pair<int,int>, bool> p;

int q[N];

void get_change(int l, int r) {
	q[r + 1] += 1;
	q[l] -= 1;
}
int main() {
	int n, l, H, _;
	n = read();
	l = read();
	H = read();
	_ = read();
	
	while (_ --) {
		int a, b;
		a = read();
		b = read();
		if (a > b) {
			swap(a, b);
		}
		if (p[make_pair(a, b)]) continue;
		if (a + 1 == b) continue;
		get_change(a + 1, b - 1);
		p[make_pair(a, b)] = true;
	}
	
	for (int i = 1; i <= n; i++) {
		q[i] += q[i - 1];
		cout << q[i] + H << endl;
	}
	
	return 0;
}

加油吧

风物长宜放眼量！！！！！