Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- using namespace std;
- int n,k,a[1001];
- int main()
- {
- cin>>n>>k;
- for(int i=1;i<=n;++i)
- cin>>a[i];
- int ns=n/k; /// Calculez numarul de secvente
- int ns1=0,ns2,gasit; /// Secventele identice: ns1 - prima si ns2 - a doua
- for(int i=1;i<=n;i+=ns)
- {
- ++ns1;
- ns2=ns1;
- for(int p=i+ns;p<=n;p+=ns)
- {
- gasit=1; /// Presupunem c-am gasit secventa identica
- ns2++;
- for(int j=0;j<ns;++j)
- if(a[i+j]!=a[p+j])
- {
- gasit=0; /// Secventa nu e identica
- break;
- }
- if(gasit)
- {
- cout<<ns1<<' '<<ns2;
- return 0;
- }
- }
- }
- cout<<"NU";
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement