CSP-201912-2-回收站选址

最新推荐文章于 2024-09-14 17:59:19 发布

原创

最新推荐文章于 2024-09-14 17:59:19 发布 · 469 阅读

10 ·

CC 4.0 BY-SA版权

文章标签：

#算法 #c++

CSP-201912-2-回收站选址

【50分思路-暴力枚举】

#include <iostream>    
#include <vector>
#include <algorithm>
using namespace std;
struct trashPoint
{
   
   
	int x; 
	int y;
};
vector<trashPoint>trashList;
vector<int>grade(5);
int main() {
   
   
	int n, max_x = -1, max_y = -1, min_x = 999, min_y = 999;
	cin >> n;
	for (int i = 0; i < n; i++)
	{
   
   
		trashPoint t;
		cin >> t.x >> t.y;
		max_x = max(max_x, t.x), max_y = max(max_y, t.y);
		min_x = min(min_x, t.x), min_y = min(min_y, t.y);
		trashList.push_back(t);
	}
	int deltaX = max_x - min_x, deltaY = max_y - min_y; 
	int moveX = min_x, moveY