247012026-02-14 09:32:13MarcLegcsalódottabb versenyző (75 pont)cpp14Wrong answer 5/7534ms1376 KiB
// Source: https://usaco.guide/general/io

#include <bits/stdc++.h>
using namespace std;

int main() {
	int n;
    cin >> n;
    vector<int>a(n+1);
    for(int i=1; i<=n; i++){
        cin >> a[i];
    }
    //int maxi=-1;
    int l=1;
    int tav=0;
    for(int r=1; r<=n; r++){
        if(a[r]>a[l]){
            tav=max(r-l,tav);
            l=r;
        }
    }
    cout << tav;
}
SubtaskSumTestVerdictTimeMemory
base5/75
1Accepted0/01ms316 KiB
2Wrong answer0/032ms1332 KiB
3Wrong answer0/51ms316 KiB
4Wrong answer0/51ms316 KiB
5Wrong answer0/51ms316 KiB
6Accepted5/51ms316 KiB
7Wrong answer0/51ms316 KiB
8Wrong answer0/51ms316 KiB
9Wrong answer0/51ms316 KiB
10Wrong answer0/51ms316 KiB
11Wrong answer0/51ms596 KiB
12Wrong answer0/51ms316 KiB
13Wrong answer0/532ms1376 KiB
14Wrong answer0/532ms1264 KiB
15Wrong answer0/534ms1296 KiB
16Wrong answer0/532ms1076 KiB
17Wrong answer0/532ms564 KiB