uva 11039
2015-01-31 16:09
309 查看
题意:给出n层去盖楼,下层高度一定比上层高度大,且相邻两层颜色不同,然后给出了n个数,正数和负数区分颜色,绝对值代表高度,问最高有几层。
题解:直接按数的绝对值排序,然后按顺序取正负不同的数,最多能去多少个。
#include <stdio.h>
#include <cmath>
#include <algorithm>
using namespace std;
const int N = 100000;
int n, fl
;
int cmp(int a, int b) {
return abs(a) > abs(b);
}
int main() {
int t;
scanf("%d", &t);
while (t--) {
scanf("%d", &n);
for (int i = 0; i < n; i++)
scanf("%d", &fl[i]);
sort(fl, fl + n, cmp);
int temp = (fl[0] > 0) ? 1 : 0;
int res = 1;
for (int i = 1; i < n; i++) {
if (fl[i] > 0 && temp == 0) {
temp = 1;
res++;
}
else if (fl[i] < 0 && temp == 1) {
temp = 0;
res++;
}
}
printf("%d\n", res);
}
}
题解:直接按数的绝对值排序,然后按顺序取正负不同的数,最多能去多少个。
#include <stdio.h>
#include <cmath>
#include <algorithm>
using namespace std;
const int N = 100000;
int n, fl
;
int cmp(int a, int b) {
return abs(a) > abs(b);
}
int main() {
int t;
scanf("%d", &t);
while (t--) {
scanf("%d", &n);
for (int i = 0; i < n; i++)
scanf("%d", &fl[i]);
sort(fl, fl + n, cmp);
int temp = (fl[0] > 0) ? 1 : 0;
int res = 1;
for (int i = 1; i < n; i++) {
if (fl[i] > 0 && temp == 0) {
temp = 1;
res++;
}
else if (fl[i] < 0 && temp == 1) {
temp = 0;
res++;
}
}
printf("%d\n", res);
}
}
相关文章推荐
- UVa11039 - Building designing(排序+贪心)
- uva 11039 贪心法
- UVA 11039 Building desigining(水题)
- UVa 11039 Building designing (模拟)
- UVA11039
- uva_11039 - Building designing( 基數排序 )
- uva11039 设计建筑物
- (UVA - 11039)Building designing (贪心)
- UVA - 11039 Building designing(字符串)
- uva-11039水到渣的题
- UVA 11039 - Building designing
- UVa 11039 Building designing (求按绝对值升序最长正负交替数列长度)
- UVA 11039 Building designing
- UVA-11039-Building designing
- UVa 11039 - Building designing
- UVA11039 Building designing
- UVa 11039 设计建筑物
- (1.1.10)UVA 11039 Building designing(模拟题)
- UVA 11039(p78)----Building designing
- Uva Oj 11039 - Building designing