• <ins id="pjuwb"></ins>
    <blockquote id="pjuwb"><pre id="pjuwb"></pre></blockquote>
    <noscript id="pjuwb"></noscript>
          <sup id="pjuwb"><pre id="pjuwb"></pre></sup>
            <dd id="pjuwb"></dd>
            <abbr id="pjuwb"></abbr>
            posts - 195,  comments - 30,  trackbacks - 0

            A supermarket has a set Prod of products on sale. It earns a profit px for each product x∈Prod sold by a deadline dx that is measured as an integral number of time units starting from the moment the sale begins. Each product takes precisely one unit of time for being sold. A selling schedule is an ordered subset of products Sell ≤ Prod such that the selling of each product x∈Sell, according to the ordering of Sell, completes before the deadline dx or just when dx expires. The profit of the selling schedule is Profit(Sell)=Σx∈Sellpx. An optimal selling schedule is a schedule with a maximum profit.
            For example, consider the products Prod={a,b,c,d} with (pa,da)=(50,2), (pb,db)=(10,1), (pc,dc)=(20,2), and (pd,dd)=(30,1). The possible selling schedules are listed in table 1. For instance, the schedule Sell={d,a} shows that the selling of product d starts at time 0 and ends at time 1, while the selling of product a starts at time 1 and ends at time 2. Each of these products is sold by its deadline. Sell is the optimal schedule and its profit is 80.


            Write a program that reads sets of products from an input text file and computes the profit of an optimal selling schedule for each set of products.

             

            Input

            A set of products starts with an integer 0 <= n <= 10000, which is the number of products in the set, and continues with n pairs pi di of integers, 1 <= pi <= 10000 and 1 <= di <= 10000, that designate the profit and the selling deadline of the i-th product. White spaces can occur freely in input. Input data terminate with an end of file and are guaranteed correct.

            Output

            For each set of products, the program prints on the standard output the profit of an optimal selling schedule for the set. Each result is printed from the beginning of a separate line.

            Sample Input

            4  50 2  10 1   20 2   30 1
            7  20 1   2 1   10 3  100 2   8 2
            5 20  50 10
            

             

            Sample Output

            80
            185

             

            Hint

            The sample input contains two product sets. The first set encodes the products from table 1. The second set is for 7 products. The profit of an optimal schedule for these products is 185.


            #include<iostream>
            #include<cstdlib>
            using namespace std;
            #define MAX 10001
            #define min(a,b) ((a)<(b) ? (a) : (b))
            int father[MAX];
            int p[MAX];
            int result[MAX];
            struct job{
                 int value;
                 int T;
              }JOB[MAX];
            bool operator <(job job1,job job2)
             {
              if(job1.value>job2.value)
              return true;
              else
              return false;
             } 
             int find(int x)  //·µ»ØµÚ£Ø½ÚµãËùÊô¼¯ºÏµÄ¸ù½áµã
              {
            int px=x;
            while(p[px]>=0)
               px=p[px];
            int tmp;
            while(p[x]>=0)//ӦΪ³õֵΪ¸º
            {
               tmp=p[x];
               p[x]=px;
               x=tmp;
            }
            return px;
            }

               void UNION(int x,int y)
            {
            x=find(x);
            y=find(y);
            if(x==y)
               return ;
            int tmp=p[x]+p[y];
            if(p[x]>p[y])
            {
               p[y]=tmp;
               p[x]=y;
            }
            else
            {
               p[x]=tmp;
               p[y]=x;
            }
            }
             
              int main()
              {
              freopen("s.txt","r",stdin);
              freopen("key.txt","w",stdout);
              int num,temp=0;
              while(cin>>num)
              {
              memset(result,0,num);
              int i,l,j,k=0;
              for( i=0;i<num;i++)
              {
               cin>>JOB[i].value>>JOB[i].T;
               father[i]=i;
               p[i]=-1;
              }
              sort(JOB,JOB+num);
              for(i=0;i<num;i++)
              {
               j=find(min(JOB[i].T,num-1));//
               if(father[j]!=0)
                   {
                 k++;
                 result[k]=i;
                    l=find(father[j]-1);
                    UNION(l,j);
                    father[j]=father[l];
                }
              }
              i=0;
              for(j=1;j<=k;j++)
              { 
               i+=JOB[result[j]].value;}
                cout<<i<<endl;
               }

              //system("PAUSE");
              return   0;
              }
            對著課本寫得,自己都看不怎么懂。

            posted on 2009-07-02 13:11 luis 閱讀(516) 評論(0)  編輯 收藏 引用 所屬分類: 貪心*二分
            <2009年7月>
            2829301234
            567891011
            12131415161718
            19202122232425
            2627282930311
            2345678

            常用鏈接

            留言簿(3)

            隨筆分類

            隨筆檔案

            文章分類

            文章檔案

            友情鏈接

            搜索

            •  

            最新評論

            閱讀排行榜

            評論排行榜

            色婷婷久久综合中文久久蜜桃av| 久久亚洲精品成人无码网站| 久久91精品国产91久久小草| 久久九九有精品国产23百花影院| 国产精品一区二区久久精品无码 | 91麻豆国产精品91久久久| 日产精品久久久久久久| 久久综合九色综合网站| 久久久久成人精品无码| 亚洲精品国精品久久99热一| 亚洲国产精品久久久久婷婷老年 | 韩国免费A级毛片久久| 精品久久久久久久久久久久久久久| 亚洲精品久久久www| 国产精品禁18久久久夂久| 欧洲性大片xxxxx久久久| 久久国产成人精品麻豆| 综合人妻久久一区二区精品| 久久久精品久久久久久| 国内精品伊人久久久久av一坑 | 久久国产精品一国产精品金尊| 久久久久国产| 久久国产精品免费一区二区三区| 久久亚洲精品人成综合网| 久久毛片一区二区| 久久亚洲AV永久无码精品| 欧美亚洲国产精品久久蜜芽 | 色诱久久久久综合网ywww| 伊人久久一区二区三区无码| 久久国产高清一区二区三区| 久久久久国产精品| 国产成人无码久久久精品一| 欧美午夜精品久久久久免费视 | 91久久九九无码成人网站| 国产精品国色综合久久| 99久久国产综合精品麻豆| 婷婷五月深深久久精品| 久久久久久午夜成人影院| 久久99热只有频精品8| 97久久精品午夜一区二区| 久久美女网站免费|