UVA11039- Building designing
来源:互联网 发布:网络教育培训加盟 编辑:程序博客网 时间:2024/06/05 18:49
题意:有n个绝对值各不相同的非0整数,选出尽量多的数,排成一个序列,使得正负号交替,且绝对值递增。输出最长序列长度。
思路:其实按照绝对值排序后,只要选出正负号交替最长的序列就可以了。用一个标记来表示下一个要选的是正号还是负号。
#include <iostream>#include <cstdio>#include <cstring>#include <cmath>#include <algorithm>using namespace std;const int MAXN = 500005;struct node{ int x, y;}a[MAXN];int arr[MAXN], b[MAXN], order[MAXN];int n;int cmp(node a, node b) { return a.y < b.y;}int main() { int cas; scanf("%d", &cas); while (cas--) { scanf("%d", &n); for (int i = 0; i < n; i++) { scanf("%d", &a[i].x); if (a[i].x < 0) a[i].y = abs(a[i].x); else a[i].y = a[i].x; } sort(a, a + n, cmp); int cnt = 1, flag ; if (a[0].x == a[0].y) flag = 1; else flag = 0; for (int i = 1; i < n; i++) { if (a[i].x == a[i].y && !flag) { flag = 1; cnt++; } else if (a[i].x != a[i].y && flag) { flag = 0; cnt++; } } printf("%d\n", cnt); } return 0;}
0 0
- uva11039-Building designing
- uva11039 Building designing
- UVA11039 Building Designing
- UVA11039- Building designing
- uva11039 -Building designing
- UVA11039 Building designing
- 贪心--uva11039 building designing
- UVA11039 Building designing (贪心)
- Uva11039 Building design...
- Building Designing
- Building designing
- Building designing
- UVA 11039 Building designing
- UVA 11039 - Building designing
- uva 11039 - Building designing
- Uva-11039-Building designing
- UVa 11039 - Building designing
- 11039 - Building designing
- 统治世界的十大算法
- 二叉搜索树(算法导论第12章)
- 开门人和关门人 【杭电-HDOJ-1234】
- jsp 四大域范围
- poj1862~Stripies~贪心+优先队列
- UVA11039- Building designing
- 设计模式C++实现——工厂模式
- 改进bpnn
- J2EE逐项攻破(二)——Servlet基本原理
- java 对象类型转换之子对象转化成父对象
- stl疑问三:any_of, none_of,all_of解析(c++11 特型的说明)
- 操作符
- 140806暑期培训.txt
- POJ 2115 (模线性方程 -> 扩展欧几里得)