Pagini recente » Cod sursa (job #2427299) | Cod sursa (job #684662) | Cod sursa (job #2711316) | Cod sursa (job #2442650) | Cod sursa (job #2193710)
#include <fstream>
using namespace std;
ifstream cin ("reguli.in");
ofstream cout ("reguli.out");
const int nmax = 500000;
int n, x, y;
int k;
int pat[1 + nmax];
int lps[1 + nmax];
int main() {
cin >> n >> x;
for(int i = 2; i <= n; i++) {
cin >> y;
pat[i - 1] = y - x;
x = y;
}
// calculam lps-ul
int i = 0, j = 2;
n--;
lps[1] = 0;
while(j <= n) {
if(pat[i + 1] == pat[j]) {
i++;
lps[j] = i;
j++;
} else {
if(i)
i = lps[i];
else {
lps[j] = 0;
j++;
}
}
}
k = n - lps[n];
cout << k << "\n";
for(int i = 1; i <= k; i++)
cout << pat[i] << "\n";
return 0;
}