Pagini recente » Cod sursa (job #2408831) | Cod sursa (job #2072536) | Cod sursa (job #161717) | Cod sursa (job #242875) | Cod sursa (job #2288970)
#include <fstream>
using namespace std;
ifstream f("reguli.in");
ofstream g("reguli.out");
long long n,x,i,k,y,j,maxim,poz,d[500100],p[500100];
int main()
{
f>>n;
f>>x;
for(i=2;i<=n;i++){
f>>y;
d[i-1]=y-x;
x=y;
}
k=0;
for(i=2;i<=n;i++){
for(;k!=0 && d[k+1]!=d[i];)k=p[k];
if(d[k+1]==d[i])k++;
p[i]=k;
}
g<<(n-1)-p[n-1]<<'\n';
for(j=1;j<=(n-1)-p[n-1];j++)
g<<d[j]<<'\n';
return 0;
}