132482025-01-07 10:51:20MezeiDavidVölgy (100 pont)cpp17Wrong answer 40/100300ms1448 KiB
#include <iostream>
#include<vector>

using namespace std;

int main()
{
    int n;
    int hossz =0;
    int j;
    int kezd;
    cin >> n;
    vector <int> meresek(n);
    for(int i=0; i< n; i++){
        cin >> meresek[i];
    }
    for(int i=0; i<n-2; i++){
            j=i+1;
        while(j<n&&meresek[i] > meresek[j]){
            j++;
        }
        if(hossz< j-i){
            hossz = j-i;
        }
    }
    cout << hossz;
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base40/100
1Accepted0/01ms316 KiB
2Wrong answer0/02ms500 KiB
3Accepted5/51ms316 KiB
4Accepted5/51ms316 KiB
5Wrong answer0/51ms508 KiB
6Wrong answer0/51ms400 KiB
7Wrong answer0/51ms400 KiB
8Accepted5/51ms316 KiB
9Wrong answer0/52ms316 KiB
10Wrong answer0/51ms316 KiB
11Accepted5/53ms316 KiB
12Accepted5/53ms464 KiB
13Wrong answer0/54ms508 KiB
14Wrong answer0/54ms508 KiB
15Accepted5/532ms1076 KiB
16Accepted5/535ms1304 KiB
17Time limit exceeded0/5298ms1332 KiB
18Accepted5/534ms1304 KiB
19Time limit exceeded0/5289ms1300 KiB
20Time limit exceeded0/5293ms1448 KiB
21Time limit exceeded0/5300ms1332 KiB
22Time limit exceeded0/5277ms1296 KiB