Wooden Sticks

Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other)
Total Submission(s) : 35   Accepted Submission(s) : 11

Font: Times New Roman | Verdana | Georgia

Font Size: ← →

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

题意:
给出一组木棍的长l、重w,如果上一个木棍的l、w比下一个的要小的话,不需要额外时间,否则多加一分钟。
分析:
贪心算法,优先选择最长的,再从剩下的里面选择最长的。
先按l从小到大的顺序来排好(若相等,则用w),从第一个开始,往后找找到这组数一系列(即w、l都比下一个小)找到最后停止,计数+1,这是该组的最优,即贪心中的单步最优。
找完一组后,再从剩下的当中找,当找过所有的数之后,结束count即为所求的数。
代码:
#include<algorithm>
#include<stdio.h>
#include<string.h>
using namespace std;
struct sticks{
    int l;
    int w;
    int flag;
}s[5002];/*运用结构体使条理更清晰*/
int cmp(const void *a,const void *b){/*struct的二级排序,先按l排若相等,则按w排,注意大小关系*/
    struct sticks *c=(sticks*)a;
    struct sticks *d=(sticks*)b;
    if(c->l!=d->l)
        return c->l-d->l;
    else
        return c->w-d->w;
}
int main(){
    int T,n;
    int i,j,count,cl,cw;/*count是计数的,ccurrent是当前的,所以cl为当前
的长,同理cw*/
    scanf("%d",&T);
    while(T--){
        scanf("%d",&n);
        memset(s,0,sizeof(s));/*清零防干扰*/
        for(i=0;i<n;i++)
            scanf("%d%d",&s[i].l,&s[i].w);
        qsort(s,n,sizeof(s[0]),cmp);/*这里排序的数目是n,从小到大排*/
        count=1;/*第一根木棍上来肯定要花1*/
        s[0].flag=1;/*标记下是否被容纳过*/
        cl=s[0].l;/*记录当前的l*/
        cw=s[0].w;/*记录当前的w*/
        /*用循环去跟当前比较,如果都小的话,就是能被容纳,不需要多加时间*/
        for(i=1;i<n;i++){
            for(j=i;j<n;j++){
                if(s[j].flag!=1&&s[j].l>=cl&&s[j].w>=cw){
                    s[j].flag=1;
                    cl=s[j].l;
                    cw=s[j].w;
                }
            }
            j=1;
            while(s[j].flag==1)/*判断是否全被容纳过,若是,则完成*/
                j++;
            i=j;/*找到最前边的没有被标记过的一组数,即剩下中最小的一组数,再次找*/
            if(i==n)
                break;/*跳出*/
            count++;/*每找过一次,就说明一次可能,所以count计数是所求结果*/
            s[i].flag=1;
            cl=s[i].l;/*重新刷新下当前数*/
            cw=s[i].w;
        }
        printf("%d\n",count);     }
    return 0;
}

Wooden Sticks的更多相关文章

  1. HDOJ 1051. Wooden Sticks 贪心 结构体排序

    Wooden Sticks Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) To ...

  2. POJ 1065 Wooden Sticks

    Wooden Sticks Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 16262 Accepted: 6748 Descri ...

  3. HDU ACM 1051/ POJ 1065 Wooden Sticks

    Wooden Sticks Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Tot ...

  4. 1051 Wooden Sticks

    Wooden Sticks Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Tot ...

  5. C - Wooden Sticks

    C - Wooden Sticks Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64u S ...

  6. HDU 1051 Wooden Sticks (贪心)

    Wooden Sticks Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) To ...

  7. uvalive 2322 Wooden Sticks(贪心)

    题目连接:2322 Wooden Sticks 题目大意:给出要求切的n个小木棍 , 每个小木棍有长度和重量,因为当要切的长度和重量分别大于前面一个的长度和重量的时候可以不用调整大木棍直接切割, 否则 ...

  8. Wooden Sticks(杭州电1051)

    Wooden Sticks Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) To ...

  9. HDU 1051:Wooden Sticks

    Wooden Sticks Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) To ...

随机推荐

  1. Swift基本语法以及与OC的比较

    一.注释: 1.单行注释和OC一致. 2.块注释中有与OC不同点:可以嵌套注释 二.常量和变量: 1.常量:初始化后可读不可写 let 2.变量:初始化后可读可写 var //不需要指定类型,系统会自 ...

  2. in和exists的区别与SQL执行效率

    in和exists的区别与SQL执行效率最近很多论坛又开始讨论in和exists的区别与SQL执行效率的问题,本文特整理一些in和exists的区别与SQL执行效率分析 SQL中in可以分为三类: 1 ...

  3. VMware 虚拟机安装 Mac OS X Mountain Lion 苹果系统

    国内私募机构九鼎控股打造APP,来就送 20元现金领取地址:http://jdb.jiudingcapital.com/phone.html内部邀请码:C8E245J (不写邀请码,没有现金送)国内私 ...

  4. 使用python编写批量卸载android应用的脚本

    该脚本的功能是卸载android手机中安装的所有第三方应用,主要是使用adb shell pm.adb uninstall 命令,所以使用的前提是需要配好adb的环境变量,下面上代码: #!/usr/ ...

  5. js冒泡事件示例

    <html xmlns="http://www.w3.org/1999/xhtml"> <head> <title>jQuery - Start ...

  6. Linux 基础 —— RPM

    http://liaoph.com/linux-rpm/ 这篇文章主要讲 RPM 软件包管理器的使用. 软件包的演变史 最早期时,软件包是一些可以运行的程序组成的集合,可能还要加上若干配置文件和动态库 ...

  7. devenv.exe - Assert Failure visual studio 2010

    安装完成devexpress后启动vs提示 devenv.exe - assert failure  第一种在博客园找到的解决方案: 原因是机器上安装了framework 4.5 和4.5中文包,卸载 ...

  8. opencv里面CV_32FC1家族

    因为总是接触过这样一些#define里面的东西但是总也不知道是干什么用的.而且每看一次梦比一次. 对于这些东西到底是什么的简写根本就不能理解. 原意是跑一下这个例程的: cvRectangle( my ...

  9. a链接中关于this的使用

    a连接点击事件用 this 时,要用 onclick='click(this)',href='javascript:void()' a连接无法使用,要看看是不是自动变成ie7或者更低

  10. 有关于Algorithm的基础介绍

    Niklaus Wirth:Algorithm + Data Structures = Programs 这句话呢,觉得很正确,算法和程序是不同的概念,算法的思想呢有递推,枚举,分治,贪婪,试探法,模 ...