*题目编号 Problem I id: 1008
*简单题意
木头被机器加工,如果后面的木头与前面的木头相比,重量大于等于前面的且长度大于等于前面的,则机器不用启动时间,否则则需要时间启动,求最短的启动时间
*解题思路
先排序---然后选择第一个没有用过的木头,依次向后找,用掉所有可以用掉的木头,然后返回第一个没用过的木头继续找
*感想
这题竟然有重题。。。太巧了。
*AC源码
# include <stdio.h>
# include <algorithm>
struct st {
int l, w, vis;
bool operator<(const st&c)const {
return l==c.l?w<c.w:l<c.l;
}
}stick[5001];
int n;
void read() {
scanf("%d", &n);
for(int i=0; i<n; i++) {
scanf("%d%d", &stick[i].l, &stick[i].w);
stick[i].vis = 0;
}
}
void find(int i) {
int k = i;
for(int j=i+1; j<n; j++)
if(!stick[j].vis)
if(stick[k].w<=stick[j].w) {
stick[j].vis = 1;
k=j;
}
}
void work() {
int res = 0;
std::sort(stick, stick+n);
for(int i=0; i<n; i++) {
if(!stick[i].vis) {
stick[i].vis = 1;
++res;
find(i);
}
}
printf("%d\n", res);
}
int main() {
int T, n;
scanf("%d", &T);
while(T--) {
read();
work();
}
return 0;
}
Problem I
Time Limit : 2000/1000ms (Java/Other) Memory Limit : 20000/10000K (Java/Other)
Total Submission(s) : 80 Accepted Submission(s) : 42
(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 ( 9 , 4 ) , ( 2 , 5 ) , ( 1 , 2 ) , ( 5 , 3 ) , and ( 4 , 1 ) , then the minimum setup time should be 2 minutes since there is a sequence of pairs ( 4 , 1 ) , ( 5 , 3 ) , ( 9 , 4 ) , ( 1 , 2 ) , ( 2 , 5 ) .
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
2 1 3