Cod sursa(job #796507)
| Utilizator | Data | 11 octombrie 2012 17:42:50 | |
|---|---|---|---|
| Problema | Arbori de intervale | Scor | 20 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.57 kb |
#include <fstream>
using namespace std;
int n,m,v[100000],a,b,x,maxm;
void maxim(int x, int y)
{
for(int i=x;i<=y;i++)
{
if(v[i]>maxm) maxm=v[i];
}
}
int main()
{
int i;
ifstream f("arbint.in");
ofstream g("arbint.out");
f>>n>>m;
for(i=1;i<=n;i++)
{
f>>v[i];
}
for(i=1;i<=m;i++)
{
f>>x>>a>>b;
if(x==0)
{
maxm=a;
maxim(a,b);
g<<maxm<<'\n';
}
else
{
v[a]=b;
}
}
return 0;
}
