貪心算法 WOODEN STICKS 實(shí)例代碼
Problem Description
There is a pile of n wooden sticks. The length and weight of each stick are known in advance. The sticks are to be processed by a woodworking machine in one by one fashion. It needs some time, called setup time, for the machine to prepare processing a stick. The setup times are associated with cleaning operations and changing tools and shapes in the machine. The setup times of the woodworking machine are given as follows:
(a) The setup time for the first wooden stick is 1 minute. (b) Right after processing a stick of length l and weight w , the machine will need no setup time for a stick of length l' and weight w' if l<=l' and w<=w'. Otherwise, it will need 1 minute for setup.
You are to find the minimum setup time to process a given pile of n wooden sticks. For example, if you have five sticks whose pairs of length and weight are (4,9), (5,2), (2,1), (3,5), and (1,4), then the minimum setup time should be 2 minutes since there is a sequence of pairs (1,4), (3,5), (4,9), (2,1), (5,2).
Input
The input consists of T test cases. The number of test cases (T) is given in the first line of the input file. Each test case consists of two lines: The first line has an integer n , 1<=n<=5000, that represents the number of wooden sticks in the test case, and the second line contains n 2 positive integers l1, w1, l2, w2, ..., ln, wn, each of magnitude at most 10000 , where li and wi are the length and weight of the i th wooden stick, respectively. The 2n integers are delimited by one or more spaces.
Output
The output should contain the minimum setup time in minutes, one per line.
Sample Input
3 5 4 9 5 2 2 1 3 5 1 4 3 2 2 1 1 2 2 3 1 3 2 2 3 1
Sample Output
2 1 3
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#define N 5000;
struct node
{
int l;
int w;
int flag;
}sticks[5000];
int cmp(const void *p,const void *q)
{
struct node *a = (struct node *)p;
struct node *b = (struct node *)q;
if(a->l > b->l) return 1;
else if(a->l < b->l) return -1;
else return a->w > b->w ? 1 : -1;
}
int main()
{
int t,n,cnt,cl,cw;
int i,j;
scanf("%d",&t);
while(t--)
{
memset(sticks,0,sizeof(sticks));
scanf("%d",&n);
for( i = 0; i < n; i++)
scanf("%d %d",&sticks[i].l,&sticks[i].w);
qsort(sticks,n,sizeof(sticks[0]),cmp);
sticks[0].flag = 1;
cl = sticks[0].l;
cw = sticks[0].w;
cnt = 1;
for( j = 1; j < n; j++)
{
for( i = j; i < n; i++)
{
if(!sticks[i].flag&&sticks[i].l>=cl&&sticks[i].w>=cw)
{
cl = sticks[i].l;
cw = sticks[i].w;
sticks[i].flag = 1;
}
}
i = 1;
while(sticks[i].flag)
i++;
j = i;
if(j == n) break;
cl = sticks[j].l;
cw = sticks[j].w;
sticks[j].flag = 1;
cnt++;
}
printf("%d\n",cnt);
}
return 0;
}
題意:
我們要處理一些木棍,第一根的時(shí)間是1分鐘,另外的,在長(zhǎng)度為l,重為w的木棍后面的那根的長(zhǎng)度為l', 重量w',只要l <=l' 并且w <= w',就不需要時(shí)間,否則需要1分鐘,求如何安排處理木棍的順序,才能使花的時(shí)間最少。
思路:
貪心算法。先把這些木棍按長(zhǎng)度和重量都從小到大的順序排列。cl和cw是第一根的長(zhǎng)度和重量,依次比較后面的是不是比當(dāng)前的cl,cw大,是的話把標(biāo)志flag設(shè)為1,并跟新cl,cw。比較完后,再?gòu)那巴髵呙?,找到第一個(gè)標(biāo)志位為0的,作為是第二批的最小的一根,計(jì)數(shù)器加一。把它的長(zhǎng)度和重量作為當(dāng)前的cl,cw,再循環(huán)往后比較。直到所有的都處理了。
上一篇:內(nèi)部排序之堆排序的實(shí)現(xiàn)詳解
欄 目:C語(yǔ)言
下一篇:基于C語(yǔ)言sprintf函數(shù)的深入理解
本文標(biāo)題:貪心算法 WOODEN STICKS 實(shí)例代碼
本文地址:http://m.jygsgssxh.com/a1/Cyuyan/4505.html
您可能感興趣的文章
- 01-10用貪心法求解背包問(wèn)題的解決方法
- 01-10使用C++實(shí)現(xiàn)全排列算法的方法詳解
- 01-10深入第K大數(shù)問(wèn)題以及算法概要的詳解
- 01-10深入N皇后問(wèn)題的兩個(gè)最高效算法的詳解
- 01-10用C++實(shí)現(xiàn)DBSCAN聚類算法
- 01-10深入全排列算法及其實(shí)現(xiàn)方法
- 01-10全排列算法的非遞歸實(shí)現(xiàn)與遞歸實(shí)現(xiàn)的方法(C++)
- 01-10輸出1000以內(nèi)的素?cái)?shù)的算法(實(shí)例代碼)
- 01-10快速模式匹配算法(KMP)的深入理解
- 01-10海量數(shù)據(jù)處理系列之:用C++實(shí)現(xiàn)Bitmap算法


閱讀排行
- 1C語(yǔ)言 while語(yǔ)句的用法詳解
- 2java 實(shí)現(xiàn)簡(jiǎn)單圣誕樹的示例代碼(圣誕
- 3利用C語(yǔ)言實(shí)現(xiàn)“百馬百擔(dān)”問(wèn)題方法
- 4C語(yǔ)言中計(jì)算正弦的相關(guān)函數(shù)總結(jié)
- 5c語(yǔ)言計(jì)算三角形面積代碼
- 6什么是 WSH(腳本宿主)的詳細(xì)解釋
- 7C++ 中隨機(jī)函數(shù)random函數(shù)的使用方法
- 8正則表達(dá)式匹配各種特殊字符
- 9C語(yǔ)言十進(jìn)制轉(zhuǎn)二進(jìn)制代碼實(shí)例
- 10C語(yǔ)言查找數(shù)組里數(shù)字重復(fù)次數(shù)的方法
本欄相關(guān)
- 04-02c語(yǔ)言函數(shù)調(diào)用后清空內(nèi)存 c語(yǔ)言調(diào)用
- 04-02func函數(shù)+在C語(yǔ)言 func函數(shù)在c語(yǔ)言中
- 04-02c語(yǔ)言的正則匹配函數(shù) c語(yǔ)言正則表達(dá)
- 04-02c語(yǔ)言用函數(shù)寫分段 用c語(yǔ)言表示分段
- 04-02c語(yǔ)言中對(duì)數(shù)函數(shù)的表達(dá)式 c語(yǔ)言中對(duì)
- 04-02c語(yǔ)言編寫函數(shù)冒泡排序 c語(yǔ)言冒泡排
- 04-02c語(yǔ)言沒(méi)有round函數(shù) round c語(yǔ)言
- 04-02c語(yǔ)言分段函數(shù)怎么求 用c語(yǔ)言求分段
- 04-02C語(yǔ)言中怎么打出三角函數(shù) c語(yǔ)言中怎
- 04-02c語(yǔ)言調(diào)用函數(shù)求fibo C語(yǔ)言調(diào)用函數(shù)求
隨機(jī)閱讀
- 01-10SublimeText編譯C開發(fā)環(huán)境設(shè)置
- 01-10delphi制作wav文件的方法
- 01-11ajax實(shí)現(xiàn)頁(yè)面的局部加載
- 08-05DEDE織夢(mèng)data目錄下的sessions文件夾有什
- 01-11Mac OSX 打開原生自帶讀寫NTFS功能(圖文
- 08-05織夢(mèng)dedecms什么時(shí)候用欄目交叉功能?
- 01-10使用C語(yǔ)言求解撲克牌的順子及n個(gè)骰子
- 08-05dedecms(織夢(mèng))副欄目數(shù)量限制代碼修改
- 01-10C#中split用法實(shí)例總結(jié)
- 04-02jquery與jsp,用jquery


