andre_joy

导航

hdu 1859

地址:http://acm.hdu.edu.cn/showproblem.php?pid=1859

题意:中文……

mark:就是找x,y中出现过的最大最小数。循环跳出条件需要注意~

代码:

#include <stdio.h>

int main()
{
    int x1,x2,y1,y2,x,y;
    x1 = y1 = 232;
    x2 = y2 = -232;
    while(scanf("%d%d", &x, &y))
    {
        if(!x && !y)
        {
            if(x1 == 232) break;
            printf("%d %d %d %d\n", x1, y1, x2, y2);
            x1 = y1 = 232;
            x2 = y2 = -232;
            continue;
        }
        if(x1 > x) x1 = x;
        if(x2 < x) x2 = x;
        if(y1 > y) y1 = y;
        if(y2 < y) y2 = y;
        
    }
    return 0;
}

posted on 2012-07-04 20:51  andre_joy  阅读(98)  评论(0编辑  收藏  举报