4 solutions
- 1
Information
- ID
- 566
- Time
- 1000ms
- Memory
- 256MiB
- Difficulty
- 2
- Tags
- # Submissions
- 39
- Accepted
- 25
- Uploaded By
#include <bits/stdc++.h>
using namespace std;
int n,r=0;
int main(){
cin>>n;
int t=0;
for(int i=1;i<=n;i++){
int a,b;
cin>>a>>b;
if((a>=90)&&(a<=140)&&(b>=60)&&(b<=90))
t++;
r=max(r,t);
if(a<=90||a>=140||b<=60||b>=90)
t=0;
}
cout<<r<<endl;
return 0;
}//max(x)
#include <bits/stdc++.h> using namespace std; int n,maxn=0; int main(){ cin>>n; int ans=0; for(int i=1;i<=n;i++){ int a,b; cin>>a>>b; if(a>=90&&a<=140&&b>=60&&b<=90) ans++; maxn=max(maxn,ans); if(a<=90||a>=140||b<=60||b>=90) ans=0; } cout<<maxn<<endl; return 0; }
#include <bits/stdc++.h> using namespace std; int n,maxn=0; int main(){ cin>>n; int ans=0; for(int i=1;i<=n;i++){ int a,b; cin>>a>>b; if(a>=90&&a<=140&&b>=60&&b<=90) ans++; maxn=max(maxn,ans); if(a<=90||a>=140||b<=60||b>=90) ans=0; } cout<<maxn<<endl; return 0; }
By signing up a ZXOJ universal account, you can submit code and join discussions in all online judging services provided by us.