Pagini recente » Cod sursa (job #1011569) | Istoria paginii runda/simulare-cartita-19a/clasament | Cod sursa (job #506579) | Istoria paginii runda/moisil_9/clasament | Cod sursa (job #1784964)
#include <bits/stdc++.h>
using namespace std;
int n,m,v[200005],arb[200005];
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 >= 0; --i)
arb[i] = max(arb[i*2],arb[i*2 + 1]);
return ;
}
inline void update (int pos)
{
for (pos/=2 ; pos ; pos/=2)
arb[pos] = max(arb[pos*2],arb[pos*2 + 1]);
return ;
}
inline int query(int st,int dr)
{
int res = -1;
st+=n-1;
dr+=n;
while(st<dr)
{
if (st & 1)res = max(res,arb[st++]);
if (dr & 1)res = max(res,arb[--dr]);
st/=2;
dr/=2;
}
return res;
}
int main()
{
InParser fin("arbint.in");
OutParser fout("arbint.out");
fin >> n >> m;
for (int i = 0; i<n ; ++i)
fin >> arb[i + n];
build();
for (int i = 1; i<=m; ++i)
{
int instr , pos , x;
fin >> instr >> pos >> x;
if (instr==1)
{
--pos;
arb[pos+=n] = x;
update(pos);
}
else fout << query(pos,x) << '\n';
}
return 0;
}