UVA 11039 Building designing
2014-08-20 20:16
239 查看
大意:n个绝对值各不相同的非0整数,选出尽量多的数,排成一个序列,使得正负号交替且绝对值递增。
水题一个,但是我觉得我想的方法比较好。。。嘻嘻~~~ 就留念一下~~~
水题一个,但是我觉得我想的方法比较好。。。嘻嘻~~~ 就留念一下~~~
#include<iostream> #include<algorithm> #include<stdio.h> using namespace std; int cmp(int a,int b) { return abs(a)<abs(b); } int main() { int T,n,sum; int a[500005]; cin>>T; while(T--) { cin>>n; sum=n; for(int i=0;i<n;i++) scanf("%d",&a[i]); sort(a,a+n,cmp); for(int i=0;i<n-1;i++) { if((a[i]>0&&a[i+1]>0)||(a[i]<0&&a[i+1]<0)) sum--; } cout<<sum<<endl; } return 0; }
相关文章推荐
- UVa 11039 - Building designing
- ecjtu-summer training #5 B - Building designing UVA - 11039
- UVA - 11039 Building designing 排序
- UVA 11039(模拟,贪心)
- (1.1.10)UVA 11039 Building designing(模拟题)
- UVa 11039 (排序+贪心) Building designing
- UVA 11039 Building designing
- uva 11039 Building designing (排序)
- UVA 11039 Building Designing
- Uva Oj 11039 - Building designing
- UVA 11039 Building desigining(水题)
- UVA 11039 模拟
- 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