Cod sursa(job #1231371)
Utilizator | valeriu cojocari valeriucoj | Data | 20 septembrie 2014 13:29:28 |
---|---|---|---|
Problema | Arbori de intervale | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.58 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("arbint.in");
ofstream fout("arbint.out");
int maximum(long long t[100000], long u, long v)
{
int p=t[u-1];
for (int i=u;i<v;i++)
{
if (p<t[i]){p=t[i];}
}
return p;
}
int main()
{
long m,n,x,y,z;
long long a[100000];
fin>>n>>m;
for (int i=0;i<n;i++)
{
fin>>a[i];
}
for (int i=0;i<m;i++)
{
fin>>x>>y>>z;
if (x==0){fout<<maximum(a,y,z)<<endl;} else {a[y-1]=a[z-1];}
}
return 0;
}