Pagini recente » Cod sursa (job #3203276) | Borderou de evaluare (job #201810) | Cod sursa (job #2464230) | Cod sursa (job #778287) | Cod sursa (job #635315)
Cod sursa(job #635315)
#include<fstream>
using namespace std;
char S[501];
int lg,lgmax,st,dr,lgr;
void citire();
void rezolva();
bool verificavecini();
void afiseaza();
int main(){
citire();
rezolva();
afiseaza();
}
void citire(){
ifstream fin("palm.in");
int i=0;
while(!fin.eof()){
fin.get(S[i++]);
}
lg=i-2;
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;
}
}
bool verificavecini(){
if(st==0 || dr==lg-1)
return false;
st--,dr++;
if(S[st]==S[dr] && S[st]<S[st+1] && S[dr]<S[dr-1])
return true;
else return false;
}
void afiseaza(){
ofstream fout("palm.out");
fout<<lgr<<"\n";
fout.close();
}