Pagini recente » Cod sursa (job #1930304) | Cod sursa (job #2483612) | Cod sursa (job #1834516) | Cod sursa (job #2365244) | Cod sursa (job #1633048)
#include <fstream>
using namespace std;
ifstream fin("reguli.in");
ofstream fout("reguli.out");
int N;
long v[500005];
int p[500005];
void read()
{
fin >> N;
for(int i = 1; i <= N; ++i)
{
fin >> v[i];
v[i - 1] = v[i] - v[i - 1];
}
--N;
}
void compute_prefix()
{
for(int i = 2, q = 0; i <= N; ++i)
{
while(q != 0 && v[q + 1] != v[i]) // wtf. aici era greseala
q = p[q];
if(p[q + i] == p[i])
q++;
p[i] = q;
}
}
void write()
{
fout << N - p[N] << '\n';
for(int i = 1; i <= N - p[N]; ++i)
fout << p[i] << "\n";
}
int main()
{
read();
compute_prefix();
write();
return 0;
}