Problem Description
(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
Output
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
迷之wa1:
#include<iostream>
#include<algorithm>using namespace std;
#define N 10010
int weight[N];
struct node
{
int l,w;
}
stick[N];
bool cmp(node a,node b)
{
return a.l<b.l;
}
int main()
{
int T,n,i,j,count;
cin>>T;
while(T--)
{
cin>>n;
for(i=0;i<n;i++)
{
cin>>stick[i].l>>stick[i].w;
weight[i]=0;
}
sort(stick,stick+n,cmp);
count=1;
for(i=0;i<n;i++)
{
for(j=0;j<count;j++)
{
if(stick[i].w>=weight[j])
{
weight[j]=stick[i].w;
break;
}
}
if(j>=count)
{
weight[count]=stick[i].w;
count++;
}
}
cout<<count<<endl;
}
return 0;
}
迷之wa2:
#include<iostream>
#include<algorithm>
using namespace std;
#define N 10010
int weight[N];
struct node
{
int l,w;
bool flag;
}
stick[N];
bool cmp(node a,node b)
{
return a.l<b.l;
}
int main()
{
int T,n,i,j,count;
cin>>T;
while(T--)
{
cin>>n;
for(i=0;i<n;i++)
{
cin>>stick[i].l>>stick[i].w;
weight[i]=0;
stick[i].flag=0;
}
sort(stick,stick+n,cmp);
count=0;
for(i=0;i<n;i++)
{
if(stick[i].flag==0)
{
count++;
int minw=stick[j].w;
for(j=0;j<n;j++)
{
if(stick[j].flag==0&&stick[j].w>=minw)
{
stick[j].flag=1;
minw=stick[j].w;
}
}
}
}
cout<<count<<endl;
}
return 0;
}
迷之ac3:
#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
struct su{
int a;
int b;
int flag;
}s[10010];
int cmp(su x,su y)
{
if(x.a==y.a)
return x.b<y.b;
else
return x.a<y.a;
}
int main()
{
int t;
scanf("%d",&t);
while(t--)
{
int i,n,j,count=0,temp;
scanf("%d",&n);
memset(s,0,sizeof(s));
for(i=0;i<n;i++)
scanf("%d%d",&s[i].a,&s[i].b);
sort(s,s+n,cmp);
for(i=0;i<n;i++)
{
if(s[i].flag==0)
{
count++;
temp=i;
for(j=i+1;j<n;j++)
{
if(s[j].flag==0&&s[temp].b<=s[j].b)
{
temp=j;
s[j].flag=1;
}
}
}
}
printf("%d\n",count);
}
return 0;
}
我的代码就是个谜=。=