Cod sursa(job #1033541)
| Utilizator | Data | 17 noiembrie 2013 09:57:09 | |
|---|---|---|---|
| Problema | Arbori de intervale | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.42 kb |
#include<fstream>
using namespace std;
ifstream f("arbint.in"); ofstream g("arbint.out");
int N,M,A[100001];
int Maxim(int st, int dr)
{ int maxim=A[st];
for(int i=st+1; i<=dr; i++) if(maxim<A[i]) maxim=A[i];
return maxim;
}
int main()
{ f>>N>>M;
for(int i=1; i<=N; i++) f>>A[i];
while(M--)
{ int tip,p,u;
f>>tip>>p>>u;
if(tip==0) g<<Maxim(p,u)<<"\n"; else A[p]=u;
}
g.close(); return 0;
}
