Cod sursa(job #1521436)
Utilizator | Data | 10 noiembrie 2015 14:10:28 | |
---|---|---|---|
Problema | Arbori de intervale | Scor | 50 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.59 kb |
#include <fstream>
using namespace std;
int v[100003];
int main ()
{
ifstream fin ("arbint.in");
ofstream fout ("arbint.out");
int n,m,u=0;
fin>>n>>m;
int a,b,c;
for (int i=1;i<=n;++i)
{
fin>>v[i];
}
for (int i=1;i<=m;++i)
{
fin>>a>>b>>c;
if (a==0)
{
for (int j=b;j<=c;++j)
{
if (u<v[j])
{
u=v[j];
}
}
fout<<u<<"\n";
}
if (a==1)
{
v[b]=c;
}
u=0;
}
}