coderforces 702AMaximum Increase
来源:互联网 发布:支付宝java服务端 编辑:程序博客网 时间:2024/05/29 09:56
A. Maximum Increase
time limit per test
1 secondmemory limit per test
256 megabytesinput
standard inputoutput
standard outputYou are given array consisting of n integers. Your task is to find the maximum length of an increasing subarray of the given array.
A subarray is the sequence of consecutive elements of the array. Subarray is called increasing if each element of this subarray strictly greater than previous.
Input
The first line contains single positive integer n (1 ≤ n ≤ 105) — the number of integers.
The second line contains n positive integers a1, a2, ..., an (1 ≤ ai ≤ 109).
Output
Print the maximum length of an increasing subarray of the given array.
Examples
input
51 7 2 11 15
output
3
input
6100 100 100 100 100 100
output
1
input
31 2 3
output
3
题意:找最长的递增序列中所含的元素的个数
#include<cstdio>#include<iostream>using namespace std;int main(){ int t; int a[100010]; while(cin >> t) { int sum = 1,falg = 1; cin >> a[0]; for(int i = 1 ; i < t ; i++) { cin >> a[i]; if(a[i] > a[i-1]) { falg++; if(i == t - 1) sum = max(sum,falg); } else { sum = max(sum,falg); falg = 1; } } cout << sum << endl; } return 0;}
0 0
- coderforces 702AMaximum Increase
- Educational Codeforces Round 15--AMaximum Increase--求最长上升数列的长度
- CodeForces 702A Maximum Increase
- codeforces-702A-Maximum Increase
- CodeForces 702A Maximum Increase
- codeforces 702A Maximum Increase
- coderforces 702B - Powers of Two(二分)
- coderforces 702C Cellular Network(二分)
- coderforces 702DRoad to Post Office
- 【Codeforces】-702A- Maximum Increase(水)
- CodeForces 702A Maximum Increase 水
- CodeForces 702A Maximum Increase (DP)
- Coderforces集锦
- Coderforces Round #
- Coderforces Next_Round
- Coderforces Team
- Coderforces Bit++
- Coderforces Football
- 数据结构存在的意义
- Python.h No such file or directory问题解决
- JavaWeb 项目安全问题及其解决方案
- Java之旅20160801
- FAT32文件系统
- coderforces 702AMaximum Increase
- Color.argb(f,r,g,b);
- android侧滑菜单,slidingmenu集成进androidstudio以及使用
- 文章标题 HDU 3853:LOOPS (概率DP)
- hdu 1325(Is It A Tree?)
- WINDOWS.H already included.MFC apps must not #include <windows.h>
- NS3 - OpenFlow switch support
- 深入JVM(Java虚拟机)(一)Java虚拟机内存区域划分
- torch 安装