Pagini recente » Cod sursa (job #2338035) | Cod sursa (job #1419467) | Cod sursa (job #684131) | Cod sursa (job #2761309) | Cod sursa (job #2288951)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("reguli.in");
ofstream g("reguli.out");
long long v[500002],n,x,y,urm[500002];
int main()
{
int i;
f>>n;
f>>x;
for(i=2;i<=n;i++)
{
f>>y;
v[i-1]=y-x;
x=y;
}
n--;
int k=0;
for(i=2;i<=n;i++)
{
while(k!=0&&v[k+1]!=v[i]) k=urm[k];
if(v[k+1]==v[i])k++;
urm[i]=k;
}
g<<n-urm[n]<<'\n';
for(i=1;i<=n-urm[n];i++)
g<<v[i]<<'\n';
return 0;
}