Submission #518600

#TimeUsernameProblemLanguageResultExecution timeMemory
518600sudheerays123Global Warming (NOI13_gw)C++98
6 / 40
1090 ms8140 KiB
#include <bits/stdc++.h> using namespace std; #define fast ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); #define ll long long int #define tc ll test;cin >> test;while(test--) #define vi vector<ll> #define pll pair<ll,ll> #define pb push_back #define mp make_pair #define INF 1e18 #define MOD 1000000007 #define ff first #define ss second #define in >> #define out << #define space << " " << #define spacef << " " #define fo(i,a,b) for(ll i = a; i <= b; i++) #define rfo(i,a,b) for(ll i = a; i >= b; i--) #define nextline out "\n" #define print(x) for(auto i : x ) cout out i spacef #define mmax(x,i) x = max(x,i) #define mmin(x,i) x = min(x,i) #define N 105 int main() { fast; ll n; cin in n; vi h(n+5); fo(i,1,n) cin in h[i]; ll ans = -INF; fo(i,1,n){ bool foundone = false; ll ans1 = 0; fo(j,1,n){ if(h[j] >= h[i] && !foundone){ ans1++; foundone = true; } if(h[j] < h[i]) foundone = false; } mmax(ans,ans1); } cout out ans; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...