UVA 11039 Building designing
来源:互联网 发布:acca伦敦大学硕士知乎 编辑:程序博客网 时间:2024/04/29 23:48
思路:把数列按绝对值从小到大排列,然后判断正负数相间的个数。
代码如下:
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int a[500001];
bool cmp(int a,int b)
{
return abs(a)<abs(b);
}
int main()
{
int n;
scanf("%d",&n);
while(n--)
{
int m,i,flag,ans=1;
scanf("%d",&m);
for(i=0;i<m;i++) scanf("%d",&a[i]);
sort(a,a+m,cmp);
if(a[0]>0) flag=1;
else flag=0;
for(i=0;i<m-1;i++)
{
if(flag==1&&a[i+1]<0)
{
flag=0;
ans++;
}
else if(flag==0&&a[i+1]>0)
{
flag=1;
ans++;
}
}
printf("%d\n",ans);
}
return 0;
}
0 0
- UVA 11039 Building designing
- UVA 11039 - Building designing
- uva 11039 - Building designing
- Uva-11039-Building designing
- UVa 11039 - Building designing
- Uva - 11039 - Building designing
- UVA 11039 - Building designing
- uva 11039 Building designing
- Uva 11039 - Building designing
- UVA 11039 - Building designing
- UVA - 11039 Building designing
- UVA 11039 Building designing
- UVA 11039 Building designing
- UVA - 11039 Building designing
- UVa 11039 - Building Designing
- UVa 11039 - Building designing
- UVA - 11039 Building designing
- UVA 11039 Building Designing
- 安装scala时报错 Exception in thread "main" java.lang.UnsupportedClassVersionError: scala/tools/nsc/ 解决方法
- 从源码角度简析 LinkedList 和 ArrayList
- POJ 3616 Milking Time
- 多路查找树之2-3树的插入原理
- 标签传播算法(Label Propagation)及Python实现
- UVA 11039 Building designing
- 在ccs7下进行DM6467的开发(4):实用的代码分析与编写
- 2013年第四届蓝桥杯C/C++组真题补充训练(一,2017.3.4)未完待续
- 关于View和ViewGroup
- 人工智能—问题规约法(Reduction)[二]
- 隐藏android设置自带控件
- tempdb 诊断
- Java库中的具体集合
- 人工智能—问题规约法(Reduction)[一]