UVa 11039 - Building designing
2013-04-02 10:22
295 查看
/* n个绝对值不同的数,选出尽量多的数,拍成一个序列,使得正负交互,且绝对值递增。 贪心 首先按绝对值大小排序, 然后往后一个一个的数 */ #include<stdio.h> #include<math.h> #include<algorithm> using namespace std; #define N 500000+10 double a ; bool cmp(double a,double b) { return fabs(1.0*a)<fabs(1.0*b); } int main() { int t,n,i,count,j; scanf("%d",&t); while(t--) { scanf("%d",&n); for(i=0;i<n;i++) scanf("%lf",&a[i]); sort(a,a+n,cmp); //for(i=0;i<n;i++) // printf("%d ",a[i]); count=1; for(i=1;i<n;i++) { /*for(j=i+1;j<n;j++) { if(a[i]<0 && a[j]<0) continue; else if(a[i]>0 && a[j]>0) continue; else { count++; i=j; } }*/ if(a[i]*a[i-1]<0) count++; } printf("%d\n",count); } return 0; }
相关文章推荐
- Uva - 11039 - Building designing
- uva 11039 - Building designing(贪心)
- UVA 11039 - Building designing 水题哇~
- UVa 11039 设计建筑物
- [UVA-11039] Building designing(贪心)
- UVA 11039(p78)----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水到渣的题
- uva 11039 Building designing (排序)
- uva 11039
- UVA 11039 - Building designing