Pagini recente » Cod sursa (job #1413397) | Cod sursa (job #1817420) | Cod sursa (job #2223098) | Cod sursa (job #2152069) | Cod sursa (job #1344513)
#include <fstream>
using namespace std;
ifstream fin ("reguli.in");
ofstream fout ("reguli.out");
long long N, k, V[500010], S[500010];
int main()
{
fin >> N;
for (int i = 1; i <= N; i++) fin >> V[i];
for (int i = 1; i < N; i++) V[i] = V[i+1] - V[i];
N--;
for (int i = 2; i <= N; i++)
{
while (k && V[k+1] != V[i]) k = S[k];
if (V[k+1] == V[i]) k++;
S[i] = k;
}
k = N - S[N];
fout << k << '\n';
for (int i = 1; i <= k; i++) fout << V[i] << '\n';
fout.close();
return 0;
}