Cod sursa(job #2129786)
Utilizator | Data | 13 februarie 2018 09:23:08 | |
---|---|---|---|
Problema | Arbori de intervale | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <fstream>
using namespace std;
ifstream fin("arbint.in");
ofstream fout("arbint.out");
int main()
{int a[100000],max1,n,m,i,j,b,d,c;
fin>>n>>m;
for(i=1;i<=n;i++)
fin>>a[i];
for(i=1;i<=m;i++)
{fin>>c>>b>>d;
if(c==1)
a[b]=d;
else
{ max1=0;
for(j=b;j<=d;j++)
if (max1<a[j])
max1=a[j];
fout<<max1<<endl;
} }
return 0;
}