Pagini recente » Cod sursa (job #1133842) | Cod sursa (job #612230) | Cod sursa (job #2335269) | Cod sursa (job #954782) | Cod sursa (job #1784085)
#include <fstream>
#include <algorithm>
using namespace std;
int arb[200010], n;
class InParser
{
private:
FILE *fin;
char *buff;
int sp;
char read_ch()
{
++sp;
if (sp == 4096)
{
sp = 0;
fread(buff, 1, 4096, fin);
}
return buff[sp];
}
public:
InParser(const char* nume)
{
fin = fopen(nume, "r");
buff = new char[4096]();
sp = 4095;
}
InParser& operator >> (int &n)
{
char c;
while (!isdigit(c = read_ch()) && c != '-');
int sgn = 1;
if (c == '-')
{
n = 0;
sgn = -1;
}
else
{
n = c - '0';
}
while (isdigit(c = read_ch()))
{
n = 10 * n + c - '0';
}
n *= sgn;
return *this;
}
InParser& operator >> (long long &n)
{
char c;
n = 0;
while (!isdigit(c = read_ch()) && c != '-');
long long sgn = 1;
if (c == '-')
{
n = 0;
sgn = -1;
}
else
{
n = c - '0';
}
while (isdigit(c = read_ch()))
{
n = 10 * n + c - '0';
}
n *= sgn;
return *this;
}
};
class OutParser {
private:
FILE *fout;
char *buff;
int sp;
void write_ch(char ch) {
if (sp == 50000) {
fwrite(buff, 1, 50000, fout);
sp = 0;
buff[sp++] = ch;
} else {
buff[sp++] = ch;
}
}
public:
OutParser(const char* name) {
fout = fopen(name, "w");
buff = new char[50000]();
sp = 0;
}
~OutParser() {
fwrite(buff, 1, sp, fout);
fclose(fout);
}
OutParser& operator << (int vu32) {
if (vu32 <= 9) {
write_ch(vu32 + '0');
} else {
(*this) << (vu32 / 10);
write_ch(vu32 % 10 + '0');
}
return *this;
}
OutParser& operator << (long long vu64) {
if (vu64 <= 9) {
write_ch(vu64 + '0');
} else {
(*this) << (vu64 / 10);
write_ch(vu64 % 10 + '0');
}
return *this;
}
OutParser& operator << (char ch) {
write_ch(ch);
return *this;
}
OutParser& operator << (const char *ch) {
while (*ch) {
write_ch(*ch);
++ch;
}
return *this;
}
};
inline void build ()
{
for (int i = n - 1; i; --i)
arb[i] = max (arb[(i << 1)], arb[(i << 1) + 1]);
}
inline void update (int poz, int val)
{
arb[poz += n - 1] = val;
for (poz >>= 1; poz; poz >>= 1)
arb[poz] = max (arb[poz << 1], arb[(poz << 1) + 1]);
}
inline int querry (int st, int dr)
{
int rez = -1;
for (st += n - 1, dr += n; st < dr; st >>= 1, dr >>= 1)
{
if (st & 1) rez = max (rez, arb[st++]);
if (dr & 1) rez = max (rez, arb[--dr]);
}
return rez;
}
int main ()
{
InParser cin ("arbint.in");
OutParser cout ("arbint.out");
int m;
cin >> n >> m;
for (int i = 0; i < n; ++i)
cin >> arb[i + n];
build ();
for (int i = 1; i <= m; ++i)
{
int op, x, y;
cin >> op >> x >> y;
if (!op) cout << querry (x, y) << '\n';
else update (x, y);
}
return 0;
}