Cod sursa(job #1113745)
Utilizator | Data | 20 februarie 2014 21:09:13 | |
---|---|---|---|
Problema | Arbori de intervale | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.55 kb |
#include <fstream>
#define NMAX 100001
using namespace std;
int n,v[NMAX];
int main()
{
ifstream f("arbint.in");
ofstream g("arbint.out");
int i,m,tip,a,b,max,j;
f>>n>>m;
for(i=1;i<=n;++i)
f>>v[i];
for(i=1;i<=m;++i)
{
f>>tip>>a>>b;
if(tip==0)
{
max=v[a];
for(j=a+1;j<=b;++j)
if(v[j]>max)
max=v[j];
g<<max<<"\n";
}
if(tip==1)
{
v[a]=b;
}
}
return 0;
}