Cod sursa(job #2897073)
Utilizator | Data | 2 mai 2022 12:53:21 | |
---|---|---|---|
Problema | PalM | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.53 kb |
#include <iostream>
#include <fstream>
using namespace std;
string s;
int st,dr,mx;
int main()
{
ifstream f ("palm.in");
ofstream g ("palm.out");
f>>s;
int sz=s.size();
for (int i=0; i<sz; i++)
{
st=i-1;
dr=i+1;
while(st>=0 && dr<sz)
{
if (s[st]==s[dr] && s[st]<=s[st+1] && s[dr]<=s[dr-1])
{
mx=max(mx,dr-st+1);
st--;
dr++;
}
else break;
}
}
g<<mx;
}