Cod sursa(job #1706036)
| Utilizator | Data | 21 mai 2016 13:10:43 | |
|---|---|---|---|
| Problema | Arbori de intervale | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#include <fstream>
using namespace std;
ifstream cin("arbint.in");
ofstream cout("arbint.out");
int n,m,a[100001];
int Maxim(int x, int y)
{int i,maxi;
maxi=a[x];
for (i=x+1;i<=y;i++)
if (a[i]>maxi) maxi=a[i];
return maxi;
}
int main()
{int i,x,y,z,j;
cin>>n>>m;
for (i=1;i<=n;i++) cin>>a[i];
for (j=1;i<=m;j++)
{cin>>x>>y>>z;
if (x==0) cout<<Maxim(y,z)<<"\n";
if (x==1) a[y]=a[z];
}
cin.close();
cout.close();
return 0;
}
