求调!!!
  • 板块学术版
  • 楼主封禁用户
  • 当前回复4
  • 已保存回复4
  • 发布时间2024/1/27 18:36
  • 上次更新2024/1/27 20:28:56
查看原帖
求调!!!
1001535
封禁用户楼主2024/1/27 18:36
#include <bits/stdc++.h>
using namespace std;
#define int long long
int x_1,x_2,y_1,y_2;
int n;
int a[100001],b[100001];
int maxx=-1e9;
int maxx2=-1e9;
main() {
	cin>>x_1>>y_1>>x_2>>y_2;
	cin>>n;
	for(int i=1;i<=n;i++) {
		cin>>a[i]>>b[i];
	}
	for(int i=1;i<=n;i++) {
		if(abs((x_1-a[i]))*abs((x_1-a[i]))+abs((y_1-b[i]))*abs((y_1-b[i]))<=abs((x_2-a[i]))*abs((x_2-a[i]))+abs((y_2-b[i]))*abs((y_2-b[i]))) {
		maxx=max(abs((x_1-a[i]))*abs((x_1-a[i]))+abs((y_1-b[i]))*abs((y_1-b[i])),maxx);
	}
    else if(abs((x_1-a[i]))*abs((x_1-a[i]))+
		abs((y_1-b[i]))*abs((y_1-b[i]))>
		abs((x_2-a[i]))*abs((x_2-a[i]))+abs((y_2-b[i]))*abs((y_2-b[i])))
		maxx2=max(abs((x_2-a[i]))*abs((x_2-a[i]))+abs((y_2-b[i]))*abs((y_2-b[i])),maxx2);	
		}
////		cout<<maxx;
////		cout<<endl<<maxx2;
	cout<<maxx+maxx2;
	return 0;
}
/**/
/**/

思路错了吗?

求修改

P1158

2024/1/27 18:36
加载中...