Cod sursa(job #833985)
Utilizator | Data | 13 decembrie 2012 16:08:16 | |
---|---|---|---|
Problema | Arbori de intervale | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.57 kb |
#include <fstream>
using namespace std;
ifstream cin("arbint.in");
ofstream cout("arbint.out");
int main(){
int v[100], n, m, i, a, b, max=0, j;
bool c;
cin>>n;
cin>>m;
for(i=1;i<=n;i++)
cin>>v[i];
for(i=1;i<=m;i++)
{
cin>>c;
cin>>a;
cin>>b;
if(c==1)
v[a]=b;
if(c==0)
{
for(j=a;j<=b;j++)
{
if(v[j]>max)
max=v[j];
}
cout<<max<<endl;
max=0;
}
}
}