資源簡(jiǎn)介
二維面上,黑點(diǎn)橫縱坐標(biāo)都大于白點(diǎn)則稱可配對(duì),求平面上的的最大配對(duì)數(shù),
代碼片段和文件信息
#include
#include
#define?num?4
#define?MAX?1000000
struct?point?
{
float?x;
????float?y;
????int?tag;
}w[num]b[num];
void?sort(point?w[]?int?n);
int??match(point?w[]point?b[]int?n);
int?main(void)
{
int?icount;
????//如果想自行輸入點(diǎn)坐標(biāo)就使用這段代碼?
????/*
printf(“輸入點(diǎn)對(duì)的個(gè)數(shù)\n“);
? scanf(“%d“&n);
?? printf(“輸入黑點(diǎn)的坐標(biāo)\n“);
?? for(i=0;i {?scanf(“%f?%f“&b[i].x&b[i].y);?}
printf(“輸入白點(diǎn)的坐標(biāo)\n“);
? for(i=0;i ????{scanf(“%f?%f“&w[i].x&w[i].y);?}????????
????*/
????????????????
????b[0].x=3; b[1].x=9; b[2].x=5;????b[3].x=5;//數(shù)據(jù)初始化?
b[0].y=4;???????b[1].y=3;???????b[2].y=6;????b[3].y=3;
w[0].x=2;???????w[1].x=4;???????w[2].x=8;????w[3].x=4;
w[0].y=1;???????w[1].y=5;???????w[2].y=3;????w[3].y=4;
printf(“黑點(diǎn)的坐標(biāo)為:\n“);
????for(i=0;i ????????printf(“????(%f%f)??\n“b[i].xb[i].y);
????printf(“\n\n“);
????printf(“白點(diǎn)的坐標(biāo)為:\n“);?
for(i=0;i ????printf(“????(%f%f)??\n“w[i].xw[i].y);
????printf(“\n\n“);
????
for(i=0;i
評(píng)論
共有 條評(píng)論