Cod sursa(job #654253)
| Utilizator | Data | 29 decembrie 2011 22:50:30 | |
|---|---|---|---|
| Problema | Arbori de intervale | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.52 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in ("arbint.in");
ofstream out ("arbint.out");
const int N=10000;
int mare,n,m,i,a[N];
void maxim (int x,int y)
{
mare=0;
for (int j=x;j<=y;j++)
if (mare<a[j]) mare=a[j];
out<<mare<<"\n";
}
int main()
{
int x,y,z;
in>>n>>m;
for (i=1;i<=n;i++)
in>>a[i];
for (i=1;i<=m;i++)
{
in>>x>>y>>z;;
if (x==0) maxim (y,z);
else a[y]=z;
}
return 0;
}
