九度OJ 1017 还是畅通工程

#include <iostream>
#include <string.h>
#include <sstream>
#include <math.h>
#include <vector>
#include <stack>
#include <algorithm>
using namespace std;

struct Node
{
    int startPoint;
    int endPoint;
    int len;
    bool operator <(const Node other) const
    {
        return len<other.len?true:false;
    }
};
int findParent(int isAdded[],int point)
{
    if(isAdded[point]==-1)
        return point;
    else
        return findParent(isAdded,isAdded[point]);
}
int main()
{
   int n = 0;
   cin>>n;
   while(n!=0)
   {
       Node areaPoint[5000];
       int totalCost = 0;
       if(n==1)
       {
           cout<<totalCost<<endl;
           cin>>n;
           continue;
       }
       int isAddEd[101];
       int i;
       for(i=0;i<101;i++)
        isAddEd[i] = -1;
       int edge = 0;
       for(i=0;i<n*(n-1)/2;i++)
       {
           cin>>areaPoint[i].startPoint>>areaPoint[i].endPoint>>areaPoint[i].len;
       }
       sort(areaPoint,areaPoint+n*(n-1)/2);

       for(i=0;i<n*(n-1)/2;i++)
       {
           int start = areaPoint[i].startPoint;
           int rear = areaPoint[i].endPoint;

               int startParent = findParent(isAddEd,start);

               int rearParent = findParent(isAddEd,rear);
               //cout<<start<<" "<<rear<<" "<<startParent<<" "<<rearParent<<endl;


               if(startParent == rearParent)
               {
                   continue;
               }
               else
               {
                   isAddEd[startParent] = rearParent;
                   totalCost += areaPoint[i].len;
                   edge++;
                   if(edge==n-1)
                    break;
               }
       }
       cout<<totalCost<<endl;
       cin>>n;
   }

    return 1;
}