Cod sursa(job #693921)
Utilizator | Data | 27 februarie 2012 17:43:19 | |
---|---|---|---|
Problema | Arbori de intervale | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <fstream>
using namespace std;
ifstream f("arbint.in");
ofstream g("arbint.out");
int v[200005],i,n,mij,maxim,m,a,b,o;
int main()
{
f>>n>>m;
for(i=1;i<=n;i++)
f>>v[i];
for(i=1;i<=n;i=i+2)
construieste(1,1,n,)
for(i=1;i<=m;i++)
{
f>>o>>a>>b;
if(o)
v[a]=v[b];
}
return 0;
}