Pagini recente » Cod sursa (job #2128284) | Cod sursa (job #1158385) | Cod sursa (job #1507164) | Cod sursa (job #2598131) | Cod sursa (job #1304873)
#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];
for (int i = 2; i < N; i++)
{
if (k && V[k+1] != V[i]) k = S[k];
if (V[k+1] == V[i]) k++;
S[i] = k;
}
k = N - S[N-1] - 1;
fout << k << '\n';
for (int i = 1; i <= k; i++) fout << V[i] << '\n';
fout.close();
return 0;
}