poj-1062-昂贵的聘礼

1.建图 每个人物是一个点，起点是酋长，求到每个点的最短距离中的最小值
2.注意地位高低互相不能互相交易 坑点
3枚举区间 重点

#include<cstdio>
#include<cmath>
#include<cstring>
#include<cstdlib>
#define maxx 999999999;
using namespace std;
int dis[200][200],v[1000],rat[1000],a,b,sym[1000],limit;
int m,n,p,l,x;
int Dijkstra(int w)
{
    for(int i=0;i<=n;i++)
           v[i] = maxx;
    int star = 105,pre = star,minn = maxx;
    v[star] = 0;
       memset(sym,0,sizeof(sym));
    for(int i=n;i>=1;i--)
    {
        if(v[i]>v[pre]+dis[pre][i]&&rat[i]>=w&&rat[i]<=w+m)v[i] = v[pre]+dis[pre][i];
    }
    for(int i=1;i<=n;i++)
      if(!sym[i]&&rat[i]>=w&&rat[i]<=w+m){
         if(v[i]<minn){
            pre = i;
            minn = v[i];
         }
      }
      sym[pre] = 1;
    while(pre != 1){
      for(int i=n;i>=1;i--)
      {
        if(v[i]>v[pre]+dis[pre][i]&&rat[i]>=w&&rat[i]<=w+m)v[i] = v[pre]+dis[pre][i];
      }
      minn = maxx;
      for(int i=1;i<=n;i++)
        if(!sym[i]&&rat[i]>=w&&rat[i]<=w+m){
           if(v[i]<minn){
               pre = i;
               minn = v[i];
            }
         }
         sym[pre] = 1;
      }
    return v[1];
}
int main(){
 while(scanf("%d%d",&m,&n)!=EOF)
 {
      for(int i=0;i<=n;i++)
           v[i] = maxx;
      for(int i=1;i<=n;i++)
        for(int j=1;j<=n;j++)
         dis[i][j] = maxx;
        rat[105] = 1000;
      scanf("%d%d%d",&p,&l,&x);
      dis[105][1] = p;
      limit = l;
      rat[1] = l;
       while(x--)
        {
             scanf("%d%d",&a,&b);
             dis[a][1] = b;
        }
      for(int i=2;i<=n;i++)
      {
         scanf("%d%d%d",&p,&l,&x);
         rat[i] = l;
         dis[105][i] = p;
         while(x--)
         {
             scanf("%d%d",&a,&b);
             dis[a][i] = b;
         }
      }
      int s =maxx;
      for(int k= limit-m;k<=limit;k++)
      {
          int s1 = Dijkstra(k);
          if(s1<s)s = s1;
      }//枚举区间
      printf("%d\n",s);
 }
 return 0;
}