Cod sursa(job #2789278)
Utilizator | Ionita Diana Diana_Ionita | Data | 27 octombrie 2021 12:00:54 |
---|---|---|---|
Problema | DreptPal | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.57 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin ("numarare.in");
ofstream fout ("numarare.out");
long long n,i,rez,l,r,k,a[100005],p[100005];
int main()
{
fin>>n;
for(i=1; i<=n; i++)
fin>>a[i];
for(i=1; i<n; i++)
a[i]=a[i+1]-a[i];
for(i=1; i<n; i++)
{
if(i>r)k=0;
else k=min(r-i,p[l+r-i]);
while(i+k<n&&a[i-k]==a[i+k])
k++;
p[i]=k;
if(i+k>r)
{
l=i-k;
r=i+k;
}
rez+=k;
}
fout<<rez;
return 0;
}