1 条题解
-
0
C :
#include<stdio.h> main() { int i,n,t=0,m=0; scanf("%d",&n); int a[n]; for(i=0; i<n; i++) { scanf("%d",&a[i]); } for(i=0; i<n; i++) { t++; if(a[i]>a[i+1]||i==n-1) { if(t>m) { m=t; } t=0; } } printf("%d",m); }C++ :
#include <iostream> using namespace std; int a[10000010],n,i,ma = 0,c = 0; int main(){ cin>>n; for(i = 0;i < n;i++){ cin>>a[i]; } for(i = 0;i < n;i++){ c++; if(i == n - 1 || a[i] >= a[i + 1]){ if(c > ma) ma = c; c = 0; } } cout<<ma<<endl; }Java :
import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int n = sc.nextInt(); int[] a = new int[n]; for(int i =0;i<n;i++){ a[i] = sc.nextInt(); } getSum(a); } public static void getSum(int[] a){ int count = 1;int s = 0; for(int i = 0;i<a.length-1;i++){ if(a[i+1]>a[i]){ count++; if(count > s){ s = count; } }else{ if(count > s){ s = count; } count = 1; } } System.out.print(s); } }Python :
n=int(input()) a=[] sr=input().split() for i in range(n): a.append(int(sr[i])) da=1 js=1 for i in range(1,n): if(a[i]>a[i-1]): js=js+1 else: if(js>da): da=js js=1 if(js>da): da=js print(da)
- 1
信息
- ID
- 441
- 时间
- 1000ms
- 内存
- 128MiB
- 难度
- (无)
- 标签
- 递交数
- 0
- 已通过
- 0
- 上传者