# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
146092 | 2019-08-22T04:23:54 Z | youssan_william | Pismo (COCI18_pismo) | C++14 | 1000 ms | 1912 KB |
#include <bits/stdc++.h> using namespace std; typedef long long ll; int main() { ll n ; cin >> n; ll arr[n+1]; for(int i = 1 ; i <=n ;i++) cin >> arr[i]; ll answer=10000000000 , minimum=10000000000 , maximum=-1 , secMinimum , secMaximum ; ll l=1 , r=2; for( ; ; r++) { if(r>n) { l++; r=l+1; } if(l>n) { break; } minimum=10000000000 , maximum=-1; for(int i = l ; i <= r ;i++) { minimum=min(minimum,arr[i]); maximum=max(maximum,arr[i]); } answer=min(answer,maximum-minimum); } cout << answer ; return 0; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 256 KB | Output is correct |
2 | Correct | 2 ms | 256 KB | Output is correct |
3 | Execution timed out | 1069 ms | 376 KB | Time limit exceeded |
4 | Execution timed out | 1077 ms | 376 KB | Time limit exceeded |
5 | Execution timed out | 1074 ms | 1912 KB | Time limit exceeded |
6 | Execution timed out | 1082 ms | 1912 KB | Time limit exceeded |
7 | Execution timed out | 1069 ms | 1912 KB | Time limit exceeded |