Cod sursa(job #559932)
| Utilizator | Data | 18 martie 2011 10:53:53 | |
|---|---|---|---|
| Problema | Arbori de intervale | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.47 kb |
#include<fstream>
#include<vector>
using namespace std;
int a[100001],m,n;
int main()
{
int x,y,z,i,j;
ifstream f ("arbint.in");
ofstream fout("arbint.out");
f>>n>>m;
for (i=1;i<=n;i++)
f>>a[i];
for (i=1;i<=m;i++)
{
f>>x>>y>>z;
if (x==0)
{
int maxim = a[y];
for (j=y+1;j<=z;j++)
if(maxim < a[j]) maxim = a[j];
fout<<maxim<<"\n";
}
else
a[y]=a[z];
}
f.close();
fout.close();
return 0;
}
