uva 11039 - Building designing(贪心)
来源:互联网 发布:linux配置lamp 编辑:程序博客网 时间:2024/05/07 17:35
题目大意:给出n个数,均为非0数,要求选出尽量多的数组成序列,序列要求正负交替,绝对值递增。
解题思路:读入时将正数与负数分别储存在两个数组,负数可以直接储存绝对值。然后将两个数组按照绝对大小分别排序,然后在两个数组中交替选出尽量小的数,满足绝对值大于前面一个选出的数。
#include <cstdio>#include <algorithm>#include <cmath>using namespace std;int cmp(int a, int b) {return abs(a) < abs(b);}int main() {int T, A[500010];scanf("%d", &T);while (T--) {int n;scanf("%d", &n);for (int i = 0; i < n; i++)scanf("%d", &A[i]);sort(A, A + n, cmp);int tmp = -A[0], cnt = 0;for (int i = 0; i < n; i++) {if (A[i] * tmp < 0) {tmp = -tmp;cnt++;}}printf("%d\n", cnt);}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
- hdu 2059 龟兔赛跑
- poj 1094 Sorting It All Out[ topo]
- HDU 2817 A sequence of numbers
- cocos2d-x性能优化的那些事
- Android studio 更新时连接服务器失败
- uva 11039 - Building designing(贪心)
- 工作一年半的反思和希冀
- CodeForces 349B Color the Fence (dp)
- UVA - 10304 Optimal Binary Search Tree
- Best Time to Buy and Sell Stock IV
- “拿来主义”——怎样嗅探一个串口通信程序与硬件之间的通信(三)
- 走进小作坊(二十五)----创始人
- Codeblocks_13.12中文版试用02-怎么才能编译和运行
- 为php安装swoole扩展