oj.uz

답안 #518599

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
518599 2022-01-24T09:03:56 Z sudheerays123 지구 온난화 (NOI13_gw) C++
6 / 40
 1000 ms 17492 KB 
#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;
		}

		foundone = false;
		ll ans2 = 0;

		fo(j,1,n){
			if(h[j] > h[i] && !foundone){
				ans2++;
				foundone = true;
			}
			if(h[j] <= h[i]) foundone = false;
		}

		mmax(ans,max(ans1,ans2));
	}

	cout out ans;

    return 0;
}

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 324 KB Output is correct
2 Correct 6 ms 328 KB Output is correct
3 Correct 2 ms 208 KB Output is correct
4 Correct 5 ms 336 KB Output is correct
5 Correct 7 ms 332 KB Output is correct

Subtask #2
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1100 ms 1224 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1052 ms 1852 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1082 ms 17492 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1055 ms 16832 KB Time limit exceeded
2 Halted 0 ms 0 KB -