Pagini recente » Cod sursa (job #948972) | Cod sursa (job #958123) | Cod sursa (job #1110167) | Cod sursa (job #811439) | Cod sursa (job #1315542)
#include<cstdio>
using namespace std;
int i,j,n,x,y,t;
long long v[500003],p[500003];
int main()
{
freopen("reguli.in","r",stdin);freopen("reguli.out","w",stdout);
scanf("%d %d",&n,&x);
for(i=1;i<=n;i++)
{
scanf("%d ",&y);
v[i]=y-x;
x=y;
}
j=0;
n--;
for(i=2;i<=n;i++)
{
while(j && v[j+1]!=v[i])
j=p[j];
if(v[j+1]==v[i])
j++;
p[i]=j;
}
t=n-p[n];
printf("%d\n",t);
for(i=1;i<=t;i++)
printf("%lld\n",v[i]);
return 0;
}