hdu 1051 Wooden Sticks(贪心)

原创 2015年11月18日 01:31:30

Wooden Sticks

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 15640    Accepted Submission(s): 6429


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
 

Source
 


题意:给你n个点(x,y),当xi>=xj&&yi>=yj是可以归为一个集合,求最终可以归为的集合数最少是多少。

题解:贪心。排序后,对于当前a[i].每次都找 没被用过&&离他最近&&符合条件的a[j]归为一个集合,再从a[j]开始找。


#include<cstring>
#include<cstdio>
#include<iostream>
#include<algorithm>
#define N 5005
#define INF 1e8

using namespace std;

int n;

struct point {
    int x,y;
} a[N];

bool cmp(point a,point b) {
    if(a.x==b.x)return a.y>b.y;
    return a.x>b.x;
}

bool vis[N];

bool is(point a,point b) {
    return a.x>=b.x&&a.y>=b.y;
}

int main() {
    //freopen("test.in","r",stdin);
    int t;
    cin>>t;
    while(t--) {
        scanf("%d",&n);
        for(int i=0; i<n; i++) {
            scanf("%d%d",&a[i].x,&a[i].y);
        }
        sort(a,a+n,cmp);
        int ans=n;
        memset(vis,0,sizeof vis);
        int cnt=0;
        while(cnt<n) {
            while(vis[cnt]&&cnt<n)cnt++;
            vis[cnt]=1;
            int i=cnt;
            for(int j=i+1; j<n; j++) {
                if(!vis[j]&&is(a[i],a[j])) {
                    i=j;
                    ans--;
                    vis[j]=1;
                }
            }
        }
        printf("%d\n",ans);
    }
    return 0;
}


版权声明:本文为博主原创文章,未经博主允许不得转载。

相关文章推荐

HDU:1051 Wooden Sticks(贪心+动态规划DP||LIS?)

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

HDU1051 Wooden Sticks(贪心)

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

hdu 1051 (贪心)Wooden Sticks

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

HDU 1051 Wooden Sticks 木棍 贪心

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

HDU 1051 Wooden Sticks 贪心

题意:找最长不下降子序列的个数。思路:我是这样做的,在前面所有没有访问过的序列中找一个比当前数值要小且自身数值最大的数,并把它标记为访问过,最后数没有访问过的数的个数,即是答案。因为当前数值肯定是由前...

hdu 1051 Wooden Sticks(贪心)

题目链接:点击打开链接 Wooden Sticks Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (J...

HDU 1051 Wooden Sticks(贪心)

题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1051 思路:简单贪心,升序排序第一关键字:长度,第二关键字:质量。筛的时候注意条件是 l ...

HDU 1051 Wooden Sticks(贪心)

题目传送门:点击打开链接 Wooden Sticks Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (J...

HDU1051 Wooden Sticks 贪心

简单的贪心,只需要不停的扫描这n个木棍,符合条件就继续往后扫,已经比过的直接跳过,到最后没了时间就+1,然后再从头扫描,用一个cnt来计数,循环结束的条件是cnt==n。 注意一定要先排序!!

HDU1051 Wooden Sticks(贪心)

Problem Description There is a pile of n wooden sticks. The length and weight of each stick are k...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

(最多只允许输入30个字)