Pagini recente » Cod sursa (job #3182335) | Cod sursa (job #1340823) | Cod sursa (job #934177) | Cod sursa (job #870357) | Cod sursa (job #636094)
Cod sursa(job #636094)
Utilizator |
Titus C titusu |
Data |
19 noiembrie 2011 16:59:35 |
Problema |
PalM |
Scor |
20 |
Compilator |
cpp |
Status |
done |
Runda |
.com 2011 |
Marime |
0.6 kb |
using namespace std;
#include <iostream>
#include <fstream>
#include <climits>
int main(){
char s[505];
ifstream fin("palm.in");
ofstream fout("palm.out");
int LMax=0;
fin >> s;
for(int i=0;s[i];++i){
int j,k;
//cazul impar
if(i>=0 && s[i+1]){
j=i-1,k=i+1;
while(s[j]==s[k] && j>=0 && s[k] && s[j]<=s[j+1])
j--, k++;
j++, k--;
if(k-j+1>LMax)
LMax = k - j +1;
}
//cazul impar()
if(s[i+1] && s[i]==s[i+1]){
j=i-1,k=i+2;
while(s[j]==s[k] && j>=0 && s[k] && s[j]<=s[j+1])
j--, k++;
j++, k--;
if(k-j+1>LMax)
LMax = k - j +1;
}
}
fout<< LMax << "\n";
}