1 solutions
-
0
C :
#include<stdio.h> int main() { int n,a[1005],i,t; while(~scanf("%d",&n)) {t=0; for(i=0;i<n;i++) scanf("%d",&a[i]); if(n==1) t=1; else { if(a[0]>a[1]) t++; for(i=1;i<n-1;i++) if(a[i]>a[i-1]&&a[i]>a[i+1]) t++; if(a[n-1]>a[n-2]) t++; } printf("%d\n",t); } return 0; }C++ :
#include <cstdio> #include <iostream> using namespace std ; int a[1005] ; int n ; int main() { while(scanf("%d",&n)!=EOF) { for(int i = 0 ; i<n ;i++) scanf("%d",&a[i]) ; int cnt = 0 ; if(n == 1) { printf("1\n") ; continue ; } if(a[0]>a[1]) cnt++ ; for(int i = 1 ; i<n-1 ;i++) { if(a[i]>a[i-1] && a[i]>a[i+1]) cnt++ ; } if(a[n-1]>a[n-2]) cnt++ ; printf("%d\n",cnt) ; } return 0 ; }
- 1
Information
- ID
- 18295
- Time
- 1000ms
- Memory
- 128MiB
- Difficulty
- (None)
- Tags
- # Submissions
- 0
- Accepted
- 0
- Uploaded By