Pagini recente » Cod sursa (job #458992) | Cod sursa (job #2287227) | Cod sursa (job #2139688) | Cod sursa (job #2328352) | Cod sursa (job #2572967)
#include <bits/stdc++.h>
#define pb push_back
using namespace std;
ifstream fin("pscpld.in");
ofstream fout("pscpld.out");
void debug_out() { cerr << '\n'; }
template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) { cerr << " " << H; debug_out(T...);}
#define dbg(...) cerr << #__VA_ARGS__ << " ->", debug_out(__VA_ARGS__)
#define dbg_v(x, n) do{cerr<<#x"[]: ";for(int _=0;_<n;++_)cerr<<x[_]<<" ";cerr<<'\n';}while(0)
#define dbg_ok cerr<<"OK!\n"
typedef pair<int,int> pii;
typedef long long int ll;
typedef long double ld;
const int DMAX = 1e6+10;
string s;
int d1[DMAX];
int d2[DMAX];
int n;
ll ans;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
int t,i,j;
int st,dr,k;
fin>>s;
for(i=0,st=0,dr=-1;i<s.length();i++){
k=(i>dr)?1:min(dr-i+1,d1[dr+st-i]);
while(i-k >= 0 && i+k < s.length() && s[i-k] == s[i+1])
k++;
ans+=k;
d1[i]=k--;
if(i+k > dr){
st=i-k;
dr=i+k;
}
}
for(i=0,st=0,dr=-1;i<s.length();i++){
k=(i>dr)?0:min(dr-i+1,d2[dr+st-i+1]);
while(i-k-1 >= 0 && i+k < s.length() && s[i-k-1] == s[i+1])
k++;
ans+=k;
d2[i]=k--;
if(i+k > dr){
st=i-k-1;
dr=i+k;
}
}
fout<<ans<<'\n';
return 0;
}