Sicily 1448. Antimonotonicity
来源:互联网 发布:南城金蝶软件 编辑:程序博客网 时间:2024/04/30 23:18
1448. Antimonotonicity
Constraints
Time Limit: 1 secs, Memory Limit: 32 MB
Description
I have a sequence Fred of length n comprised of integers between 1 and n inclusive. The elements of Fred are pairwise distinct. I want to find a subsequence Mary of Fred that is as long as possible and has the property that:
Mary[0] > Mary[1] < Mary[2] > Mary[3] < ...
Input
The first line of input will contain a single integer T expressed in decimal with no leading zeroes. T will be at most 50. T test cases will follow.
Each test case is contained on a single line. A line describing a test case is formatted as follows:
n Fred[0] Fred[1] Fred[2] ... Fred[n-1].where n and each element of Fred is an integer expressed in decimal with no leading zeroes. No line will have leading or trailing whitespace, and two adjacent integers on the same line will be separated by a single space. n will be at most 30000.
Output
For each test case, output a single integer followed by a newline --- the length of the longest subsequence Mary of Fred with the desired properties.
Sample Input
45 1 2 3 4 55 5 4 3 2 15 5 1 4 2 35 2 4 1 3 5
Sample Output
1253
// Problem#: 1448// Submission#: 3391238// The source code is licensed under Creative Commons Attribution-NonCommercial-ShareAlike 3.0 Unported License// URI: http://creativecommons.org/licenses/by-nc-sa/3.0/// All Copyright reserved by Informatic Lab of Sun Yat-sen University// Problem#: 1448// Submission#: 3390774// The source code is licensed under Creative Commons Attribution-NonCommercial-ShareAlike 3.0 Unported License// URI: http://creativecommons.org/licenses/by-nc-sa/3.0/// All Copyright reserved by Informatic Lab of Sun Yat-sen University#include <stdio.h>#include <iostream>#include <vector>#include <string>#include <stack>#include <iomanip>#include <algorithm>#include <queue>#include <functional>#include <map>#include <string.h>#include <math.h>using namespace std;const int MAX_N = 30005;int n[MAX_N];int N;int main() { std::ios::sync_with_stdio(false); int caseNum; cin >> caseNum; while (caseNum--) { cin >> N; for (int i = 0; i < N; i++) cin >> n[i]; int ans = 1; int i; for (i = 0; i < N - 1;) { for (; i < N - 1; i++) { if (n[i] > n[i + 1]) { ans++; break; } } i++; for (; i < N - 1; i++) { if (n[i] < n[i + 1]) { ans++; break; } } i++; } cout << ans << endl; } return 0;}
0 0
- Sicily 1448. Antimonotonicity
- Sicily 1448. Antimonotonicity
- Antimonotonicity
- Antimonotonicity
- Antimonotonicity
- TJU Antimonotonicity
- JZOJ1728. Antimonotonicity
- poj 3298 Antimonotonicity DP
- poj 3298 Antimonotonicity 贪心
- JZOJ.1728. Antimonotonicity
- Antimonotonicity (Standard IO)
- ZCMU-1231-Antimonotonicity
- TOJ 2896.Antimonotonicity(贪心)
- Sicily 1027
- sicily 1007
- sicily 1795
- sicily 1036
- sicily 1419
- Fedora20:0-目录
- selenium-webdriver(python)-- 处理下拉框
- 高仿网易新闻头部导航条--优化版
- gitlab多人协同工作
- 非对称加密(公钥密钥)概述
- Sicily 1448. Antimonotonicity
- 动态载入并使用界面XML-----LayoutInflater
- 彩色图像--图像增强 图像锐化
- Cocoapods安装与使用教程详解(最新版)
- Sicily 1376. Monthly Expense
- JQuery UI的拖拽功能实现方法小结
- The current branch is not configured for pull No value for key branch.master.merge found in configu
- Sicily 1356. The Trip, 2007
- XCode6.2快捷键