PAT L3-012 水果忍者
阿新 • • 發佈:2018-03-20
amp struct 端點 是否 ref con 不可 bool scan
占個坑,等自己數學好一點以後再來重新把這個題寫一遍
附上鏈接
附上大牛代碼:
#include <stdio.h>
#include <algorithm>
#define INF 99999999
#define ll long long
using namespace std;
struct line {
int x, y1, y2;//y1 > y2
}l[10005], id[10005];
//斜率存儲
struct vec {
int x, y;
vec(int a = 0, int b = 0):x(a), y(b) {};
};
inline int cross(vec a, vec b) {//偽叉積,大於0就返回1,小於返回-1,等於返回0
ll temp = (ll)(a.x)*(ll)(b.y) - (ll)(a.y)*(ll)(b.x);
if (temp > 0) return 1;
else if (temp == 0) return 0;
return -1;
}
int n;
vec krmax, krmin, klmax, klmin;
inline bool cmp(const line& a, const line& b) {
return a.x < b.x;
}
inline bool cmp2(const line& a, const line& b) {
return (a.y1 - a.y2) < (b.y1 - b.y2);
}
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d%d%d", &l[i].x, &l[i].y1, &l[i].y2);
sort(l + 1, l + n + 1, cmp);//先根據x坐標從小到大排個序
for (int i = 1; i <= n; i++) {
id[i].x = i;//這裏的x就是記錄豎線ID了(即記錄是從左到右的第幾根豎線)
id[i].y1 = l[i].y1;
id[i].y2 = l[i].y2;
}
sort(id + 1, id + n + 1, cmp2);//再根據y1-y2從小到大排個序,優先嘗試用“短”的豎線下方的端點作“卡子”
for (int idx = 1; idx <= n; idx++) {
int i = id[idx].x;//嘗試以從左到右的第i根豎線下方的端點作“卡子”
krmax = vec(1, INF);
krmin = vec(1, -INF);
klmax = vec(-1, -INF);
klmin = vec(-1, INF);
for (int j = i + 1; j <= n; j++) {//向右找允許的最大斜率和最小斜率
vec v1(l[j].x - l[i].x, l[j].y1 - l[i].y2);
vec v2(l[j].x - l[i].x, l[j].y2 - l[i].y2);
if (cross(krmax, v1) < 0) krmax = v1;
if (cross(krmin, v2) > 0) krmin = v2;
}
for (int j = i - 1; j >= 1; j--) {//向左找允許的最大斜率和最小斜率
vec v1(l[j].x - l[i].x, l[j].y1 - l[i].y2);
vec v2(l[j].x - l[i].x, l[j].y2 - l[i].y2);
if (cross(klmin, v1) > 0) klmin = v1;
if (cross(klmax, v2) < 0) klmax = v2;
}
//判斷以從左到右的第i根豎線下方的端點作“卡子”,是否可行,不可行直接continue
if (cross(krmax, krmin) > 0) continue;
if (cross(klmax, klmin) > 0) continue;
if (cross(krmax, klmin) < 0) continue;
if (cross(klmax, krmin) < 0) continue;
//可行,分情況討論
if (cross(klmax, krmax) * cross(klmax, krmin) <= 0)
printf("%d %d %d %d", l[i].x + klmax.x, l[i].y2 + klmax.y, l[i].x, l[i].y2);
else if (cross(klmin, krmax) * cross(klmin, krmin) <= 0)
printf("%d %d %d %d", l[i].x + klmin.x, l[i].y2 + klmin.y, l[i].x, l[i].y2);
else if (cross(klmax, krmax) > 0 && cross(klmin, krmin) < 0)
printf("%d %d %d %d", l[i].x + krmax.x, l[i].y2 + krmax.y, l[i].x, l[i].y2);
else if (cross(krmax, klmax) > 0 && cross(krmin, klmin) < 0)
printf("%d %d %d %d", l[i].x + klmin.x, l[i].y2 + klmin.y, l[i].x, l[i].y2);
break;
}
return 0;
}
PAT L3-012 水果忍者