Cod sursa(job #1571649)
Utilizator | Data | 18 ianuarie 2016 12:00:42 | |
---|---|---|---|
Problema | Arbori de intervale | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.61 kb |
#include <fstream>
using namespace std;
ifstream fin("arbint.in");
ofstream fout("arbint.out");
int n,m,i,j,a[100005],x,y,z,maxim;
int main()
{
fin>>n>>m;
for(i=1;i<=n;i++)
{
fin>>a[i];
}
for(i=1;i<=m;i++)
{
fin>>x>>y>>z;
if(x==0)
{
for(j=y;j<=z;j++)
{
if(a[j]>maxim)
{
maxim=a[j];
}
}
fout<<maxim<<"\n";
}
if(x==1)
{
a[y]=a[z];
}
maxim=0;
}
return 0;
}