Pagini recente » Cod sursa (job #1090251) | Cod sursa (job #3216139) | Cod sursa (job #2753836) | Cod sursa (job #2972308) | Cod sursa (job #1770440)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("reguli.in");
ofstream fout("reguli.out");
#define nmax 500100
long long v[nmax];
long long p[nmax];
long long n,i,k;
int main()
{
fin>>n;
for(i=1; i<=n; ++i)
fin>>v[i];
for(i=2; i<=n; ++i)
v[i-1]=v[i]-v[i-1];
--n;
for(i=2; i<=n; ++i)
{
k=p[i-1];
while(k && v[i]!=v[k+1])
k=p[k];
if(v[k+1]==v[i])
p[i]=k+1;
}
while(p[n]==p[n-1]+1 && p[n])
--n;
fout<<n<<'\n';
for(i=1; i<=n; ++i)
fout<<v[i]<<'\n';
}