Pagini recente » Cod sursa (job #2819186) | Cod sursa (job #180408) | Cod sursa (job #3030297) | Cod sursa (job #963981) | Cod sursa (job #635303)
Cod sursa(job #635303)
#include <fstream>
#include <cstring>
using namespace std;
ifstream in("palm.in");
ofstream out("palm.out");
const int N=501;
char s[N],c[N];
int l;
bool verifica(int poz,int lung){
char pozmax,maxim;
int i;
for(i=poz;i<=poz+lung-1;i++){
if(s[2*poz+lung-1 - i]!=s[i]){
return false;
}
}
//return true;
i=poz;
while(s[i+1]>s[i])
i++;
while(s[i+1]<s[i])
i++;
if(i!=(poz+lung-1))
return false;
return true;
/*for(i=poz;i<=poz+lung-1;i++){
if(s[i]!=s[2*poz+lung-1 - i])
return false;
if(i<=pozmax && s[i]>maxim*/
}
int main(){
in>>s;
int i,j,k;
strcpy(c,s);
l=strlen(s);
for(i=l;i>=1;i--){
for(j=0;j<=l-i;j++){
if(verifica(j,i)){
out<<i;
/*for(k=j;k<=j+i-1;k++){
out<<s[k];
}*/
return 0;
}
}
}
return 0;
}