133842025-01-07 18:24:29ercseferencInverziócpp17Wrong answer 10/5017ms708 KiB
#include <iostream>
using namespace std;
int a[50000]={};
int main()
{
    int n; cin>>n;
    for(int i=0; i<n; i++){cin>>a[i];}
    int maxi=a[0],tav=0,kezd,veg;
    for(int i=1; i<n; i++){
        if(maxi>a[i]){
            if(maxi-a[i]>tav){tav=maxi-a[i]; kezd=a[i]; veg=maxi;}}
        else maxi=a[i];}
    if(tav>0)cout<<kezd<<" "<<veg<<endl;
    else cout<<-1<<endl;
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base10/50
1Accepted0/01ms512 KiB
2Accepted0/016ms556 KiB
3Accepted1/11ms316 KiB
4Accepted2/21ms316 KiB
5Accepted7/71ms316 KiB
6Wrong answer0/216ms468 KiB
7Runtime error0/217ms468 KiB
8Runtime error0/217ms564 KiB
9Runtime error0/217ms520 KiB
10Runtime error0/217ms532 KiB
11Runtime error0/217ms560 KiB
12Runtime error0/217ms564 KiB
13Runtime error0/217ms528 KiB
14Runtime error0/217ms708 KiB
15Runtime error0/217ms496 KiB
16Runtime error0/217ms636 KiB
17Runtime error0/217ms596 KiB
18Runtime error0/217ms564 KiB
19Runtime error0/317ms564 KiB
20Runtime error0/317ms524 KiB
21Runtime error0/217ms564 KiB
22Runtime error0/217ms564 KiB
23Runtime error0/217ms564 KiB
24Runtime error0/217ms452 KiB