Pagini recente » Cod sursa (job #1355804) | Cod sursa (job #2667040) | Cod sursa (job #1477926) | Cod sursa (job #2845919) | Cod sursa (job #221072)
Cod sursa(job #221072)
#include <cstdio>
#include <vector>
#include <queue>
#include <stack>
#include <list>
#include <set>
#include <algorithm>
#include <utility>
#include <string>
#include <functional>
#include <sstream>
#include <fstream>
#include <iostream>
using namespace std;
#define FOR(i,a,b) for (i=a;i<=b;i++)
#define fori(it,v) for (it=(v).begin();it!=(v).end();it++)
#define pb push_back
#define mp make_pair
#define fs first
#define ss second
#define all(c) c.begin(),c.end()
#define pf push_front
#define popb pop_back
#define popf pop_front
void dfs(int x,int adancime)
{
euler.pb(mp(adancime,x));
v[x]=1;
vector<ii>::iterator it;
fori(it,a[x])
{
if (!v[*it])
{
dfs(*it,adancime+1);
euler.pb(mp(adancime,x));
}
}
v[x]=0;
}
void rmq_gen()
{
FOR(i,0,)
}
int main()
{
FILE *in,*out;
in=fopen("atac.in","r");
out=fopen("atac.out","w");
preprocesare();
gen_lca();
}