Pagini recente » Cod sursa (job #215681) | Cod sursa (job #232599) | Cod sursa (job #136283) | Cod sursa (job #2130067) | Cod sursa (job #635436)
Cod sursa(job #635436)
#include<fstream>
using namespace std;
char S[503];
int lg,lgmax,st,dr,lgr;
void citire();
void rezolva();
int verificavecini();
void afiseaza();
int main(){
citire();
rezolva();
afiseaza();
return 0;
}
void citire(){
ifstream fin("palm.in");
int i=0;
while(!fin.eof()){
fin.get(S[i++]);
}
lg=i-1;
fin.close();
}
void rezolva(){
int i;
for(i=1;i<lg-1;i++){
st=dr=i,lgmax=1;
while(verificavecini()){
lgmax+=2;
}
if(lgr<lgmax)
lgr=lgmax;
}
}
int verificavecini(){
if(st==0 || dr==lg-1)
return 0;
st--,dr++;
if(S[st]==S[dr] && S[st]<S[st+1] && S[dr]<S[dr-1])
return 1;
else return 0;
}
void afiseaza(){
ofstream fout("palm.out");
fout<<lgr<<"\n";
fout.close();
}