Cod sursa(job #878281)
| Utilizator | Data | 14 februarie 2013 11:49:29 | |
|---|---|---|---|
| Problema | Arbori de intervale | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.48 kb |
#include <iostream>
#include <fstream>
using namespace std;
fstream f("arbint.in",ios::in);
fstream g("arbint.out",ios::out);
int n,m,i,j,a,b,c,x[100005],maxi;
int main()
{
f>>n>>m;
for (i=1;i<=n;i++)
{
f>>x[i];
}
for (i=1;i<=m;i++)
{
f>>a>>b>>c;
if (a==0)
{
maxi=x[b];
for (j=b+1;j<=c;j++) if (x[j]>maxi) maxi=x[j];
g<<maxi<<"\n";
}
else x[b]=c;
}
}
