zoukankan      html  css  js  c++  java
  • 搜索---吝啬的国度

    #include <stdio.h>
    #include <memory.h>

    int map[100005];

    void Adjust(int currentCity) //定义函数(递归)
    {
    int priorCity = map[currentCity];
    if (priorCity != 0)
    {
    Adjust(priorCity);
    map[priorCity] = currentCity;
    }
    }

    int main()
    {
    int i, testNum, cityNum, startCity, cityA, cityB;
    scanf("%d", &testNum);
    while (testNum-- != 0)
    {
    scanf("%d%d", &cityNum, &startCity);
    memset(map, 0, sizeof(int)*cityNum + 1);//meset的用法
    for (i = 1; i < cityNum; i++)
    {
    scanf("%d%d", &cityA, &cityB);
    if (map[cityB] == 0)
    {
    map[cityB] = cityA;
    }
    else
    {
    Adjust(cityA);
    map[cityA] = cityB;
    }
    }
    Adjust(startCity);
    map[startCity] = - 1;
    for (i = 1; i < cityNum; i++)
    {
    printf("%d ", map[i]);
    }
    printf("%d ", map[i]);
    }
    return 0;
    }

  • 相关阅读:
    hdoj1587
    欧拉定理及其应用
    hdoj1571
    hdoj1050
    POJ推荐50题
    poj2593
    hdoj1286
    hdoj1215七夕节
    我的Linux软件
    ACM题目推荐--《算法艺术与信息学竞赛》(转)
  • 原文地址:https://www.cnblogs.com/CAOYR/p/5521693.html
Copyright © 2011-2022 走看看