Pagini recente » Cod sursa (job #1131993) | Cod sursa (job #1231827) | Cod sursa (job #2414222) | Cod sursa (job #1131988) | Cod sursa (job #2921996)
#include <fstream>
#define N 100005
using namespace std;
ifstream fin("numarare.in");
ofstream fout("numarare.out");
int n,a[N],v[N],x,d[N],ct;
long long Manacher(int* s)
{
int l=1,r=1;
for(int i=2;i<n;i++)
{
d[i]=max(0,min(r-i,d[l+(r-i)]));
while(i+d[i]<n&&i-d[i]>0&&s[i-d[i]]==s[i+d[i]]) d[i]++;
if(i+d[i]>r) l=i-d[i],r=i+d[i];
}
for(int i=1;i<=n;i++) ct+=d[i];
///for(int i=1;i<=n;i++) cout<<d[i]<<" ";
return ct;
}
int main()
{
fin>>n;
for(int i=1;i<=n;i++)fin>>a[i];
for(int i=1;i<n;i++) v[i]=a[i+1]-a[i];
if(n==1) {fout<<"0\n";return 0;}
else fout<<Manacher(v);
return 0;
}