Pagini recente » Cod sursa (job #3261135) | Cod sursa (job #2898160) | Cod sursa (job #253107) | Cod sursa (job #618793) | Cod sursa (job #2661751)
#include <fstream>
using namespace std;
ifstream f("reguli.in");
ofstream g("reguli.out");
long long x[500001],n,xd[500001],urm[500001];
int main()
{
int i;
f>>n;
for (i=1;i<=n;i++)
f>>x[i];
for (i=1;i<n;i++)
xd[i]=x[i+1]-x[i];
n--;
int k=0,nr;
urm[1]=0;
for (i=2;i<=n;i++)
{
while (k>0 && xd[k+1]!=xd[i]) k=urm[k];
if (xd[k+1]==xd[i]) k++;
urm[i]=k;
}
nr=n-urm[n];
g<<nr<<'\n';
for (i=1;i<=nr;i++) g<<xd[i]<<'\n';
return 0;
}