Pagini recente » Cod sursa (job #1633586) | Cod sursa (job #2790537) | Cod sursa (job #1625504) | Cod sursa (job #3144498) | Cod sursa (job #2592794)
#include <bits/stdc++.h>
using namespace std;
long long dif[500005];
long long x[500005];
int n;
int pi[500005];
vector<long long> res;
void Read()
{
cin>>n;
for(int i = 1;i <= n;++i)
cin>>x[i];
for(int i = 1;i < n;++i)
dif[i] = x[i + 1] - x[i];
}
void compute()
{
int q = 0;
for(int i = 2;i < n;++i)
{
while(q && dif[q + 1] != dif[i])
q = pi[q];
if(dif[q + 1] == dif[i])
++q;
pi[i] = q;
}
if(pi[n - 1] == 0)
{
cout<<n - 1<<'\n';
for(int i = 1;i < n;++i)
cout<<dif[i]<<'\n';
}
else
{
for(int i = 1;i < n && pi[i] == 0;++i)
res.push_back(dif[i]);
cout<<res.size()<<'\n';
for(vector<long long>::iterator it = res.begin();it != res.end();++it)
cout<<*it<<'\n';
}
}
int main()
{
Read();
compute();
}