#include "longesttrip.h"
#include <bits/stdc++.h>
using namespace std;
std::vector<int> longest_trip(int N, int D)
{
vector<int> d[2];
d[0]={0}, d[1]={1};
for (int i=2; i<N; i++)
{
if (are_connected(vector<int> {d[0].back()}, vector<int> {i})) d[0].push_back(i);
else if (are_connected(vector<int> {d[1].back()}, vector<int> {i})) d[1].push_back(i);
else
{
while (!d[1].empty()) d[0].push_back(d[1].back()), d[1].pop_back();
d[1].push_back(i);
}
}
if (d[0].size()>d[1].size()) return d[0];
else return d[1];
}
