-
Notifications
You must be signed in to change notification settings - Fork 0
/
1.cpp
70 lines (59 loc) · 1.12 KB
/
1.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
// maximum subarray kisckstart
#include <iostream>
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
int a[n];
for(int i=0;i<n;i++){
cin>>a[i];
}
int ans=2;
int pd = a[1]-a[0];
int j=2;
int currLen = 2;
while(j<n){
if(pd == a[j]-a[j-1]){
currLen++;
}
else{
pd=a[j]-a[j-1];
currLen=2;
}
ans=max(ans,currLen);
j++;
}
cout << ans <<endl;
return 0;
}
// https://drive.google.com/drive/folders/1-PNukHSuFB4NsmGI1U4772DBXr3eOoxR
// Record breaking day kisckstart
#include <iostream>
#include<bits/stdc++.h>
using namespace std;
int main()
{
int n;
cin>>n;
int a[n+1];
a[n] = -1;
for(int i=0;i<n;i++){
cin>>a[i];
}
if(n==1){
cout<<"1"<<endl;
return 0;
}
int ans=0;
int mx=-1;
for(int i=0;i<n;i++){
if(a[i]>mx && a[i]>a[i+1]){
ans++;
}
mx=max(mx,ans);
}
cout<<ans<<endl;
return 0;
}