Cod sursa(job #2666762)

Utilizator cezarus30cezarus30 cezarus30 Data 2 noiembrie 2020 14:47:46
Problema Subsecventa de suma maxima Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.68 kb
#include <iostream>

using namespace std;

int main()
{
    int a[1001],n,k;
    int Begin,End,ok=0;
    cin >> n >> k;
    for(int i=1; i<=n; i++)
        cin >> a[i];
    for(int i=1; i<n-k and !ok; i++)
    {
        for(int j=i+1; j<=n-k+1 and !ok; j++)
        {
            int ii=i,jj=j,nr=0;
            while(a[ii]==a[jj] and nr < k)
            {
                ii++;
                jj++;
                nr++;
            }
            if(nr==k)
            {
                ok=1;
                Begin=i;
                End=jj-k;
            }
        }
    }

    if(ok) cout << Begin << " " << End;
    else cout << "NU";

    return 0;

}