244132026-02-11 12:50:24Pedri26Következő permutáció (50 pont)cpp17Wrong answer 31/504ms512 KiB
// Source: https://usaco.guide/general/io

#include <bits/stdc++.h>
using namespace std;
int n, a[10001];
bool volte[10001];

int main() {
    
    cin>>n;
    for(int i=1;i<=n;i++)
    {
        cin>>a[i];
    }
    int eddigmax=-1;
    for(int i=n;i>=1;i--)
    {
        volte[a[i]]=true;
        if(a[i]>eddigmax)eddigmax=a[i];
        else 
        {
            for(int j=1;j<i;j++)cout<<a[j]<<" ";
            int k=a[i]+1;
            while(!volte[k])k++;
            cout<<k<<" ";
            for(int j=k-1;j>=1;j--)
            {
                if(volte[j])cout<<j<<" ";
            }
            for(int j=n;j>k;j--)
            {
                if(volte[j])cout<<j<<" ";
            }
            break;
        }
    }


    return 0;
}
SubtaskSumTestVerdictTimeMemory
base31/50
1Accepted0/01ms508 KiB
2Accepted0/03ms316 KiB
3Wrong answer0/11ms512 KiB
4Accepted1/11ms316 KiB
5Accepted1/11ms316 KiB
6Accepted1/11ms316 KiB
7Wrong answer0/21ms316 KiB
8Accepted2/21ms332 KiB
9Wrong answer0/21ms316 KiB
10Wrong answer0/21ms316 KiB
11Accepted1/11ms316 KiB
12Accepted1/11ms316 KiB
13Accepted1/11ms324 KiB
14Accepted1/11ms316 KiB
15Wrong answer0/31ms316 KiB
16Accepted3/31ms500 KiB
17Accepted3/31ms316 KiB
18Accepted3/32ms316 KiB
19Accepted3/34ms432 KiB
20Wrong answer0/34ms480 KiB
21Wrong answer0/34ms508 KiB
22Accepted3/34ms508 KiB
23Wrong answer0/34ms508 KiB
24Accepted3/34ms316 KiB
25Accepted2/24ms316 KiB
26Accepted2/24ms316 KiB