Pagini recente » Cod sursa (job #366771) | Cod sursa (job #2321520) | Cod sursa (job #1844088) | Cod sursa (job #1464151) | Cod sursa (job #3277015)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("marbles.in");
ofstream fout("marbles.out");
int a[200100];
int n, m;
int b[100];
void Init()
{
for(int i = 1; i <= 70;i++)
b[i] = 0;
}
void Mutare(int x, int y)
{
a[y + x] = a[x];
a[x] = 0;
}
void Query(int x, int y)
{
int maxim = 0;
if (y > n) y = n;
for(int i = x; i <= y;i++)
if(a[i] != 0) b[a[i]]++, maxim = max(maxim, b[a[i]]);
fout << maxim <<"\n";
}
void Citire()
{
int i, x, y, task;
fin >> n >> m;
for(i = 1; i <= n;i++)
{
fin >> x >> y;
a[x] = y;
}
for(i = 1;i <= m;i++)
{
Init();
fin >> task >> x >> y;
if(task == 0) Mutare(x , y);
else Query(x , y);
}
}
int main()
{
Citire();
return 0;
}