Pagini recente » Cod sursa (job #2116821) | Cod sursa (job #368020) | Cod sursa (job #608029) | Cod sursa (job #165779) | Cod sursa (job #1813813)
#include <fstream>
#include <vector>
using namespace std;
ifstream f("lca.in");
ofstream g("lca.out");
vector<int> Father, MarkedNodes;
void MarkNodes(int currentNode, int val)
{
do
{
MarkedNodes[currentNode] = val;
currentNode = Father[currentNode];
} while (currentNode);
}
int FindLCA(int currentNode, int val)
{
while (MarkedNodes[currentNode] != val)
currentNode = Father[currentNode];
return currentNode;
}
int main()
{
int n, m;
f >> n >> m;
Father.resize(n + 1);
MarkedNodes.resize(n + 1);
for (int i = 1; i < n; ++i)
f >> Father[i + 1];
for (int i = 1; i <= m; ++i)
{
int x, y;
f >> x >> y;
MarkNodes(x, i);
g << FindLCA(y, i) << "\n";
}
return 0;
}