Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- #define N 1001
- using namespace std;
- ifstream fin("secvpal.in");
- ofstream fout("secvpal.out");
- int n, v[N];
- bool palindrom(int i,int j)
- {
- while(i<j)
- {
- if(v[i]!=v[j])return 0;///daca nu e palin
- i++; j--;
- }
- return 1;
- }
- int main()
- {
- int i,j,lc,lmax=0,st,dr;
- fin>>n;
- for(i=1;i<=n;i++)fin>>v[i];
- ///alg
- for(i=1;i<=n;i++)
- {
- lc=0;
- for(j=n;j>i;j--)
- if(v[i]==v[j] && palindrom(i,j))///capetele egale
- {
- lc=j-i; break;
- }
- if(lc>lmax){lmax=lc;st=i;dr=j;}
- }
- fout<<st<<' '<<dr;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement