Pagini recente » Cod sursa (job #249915) | Cod sursa (job #1739239) | Cod sursa (job #47428) | Cod sursa (job #2384105) | Cod sursa (job #3277076)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("marbles.in");
ofstream fout("marbles.out");
int n, m;
struct marble
{
int x, c;
} a[100003];
void Task1(int x, int y)
{
int i;
for (i = 1; i <= n; i++)
if (a[i].x == x)
{
a[i].x = y;
return ;
}
}
void Task2(int x, int y)
{
int i, fr[70] = {0}, maxx = 0;
for (i = 1; i <= n; i++)
if (a[i].c != 0 && a[i]. x >= x && a[i].x <= y)
{
fr[a[i].c]++;
maxx = max(maxx, fr[a[i].c]);
}
fout << maxx << "\n";
}
int main()
{
int i, c, x, y;
fin >> n >> m;
for (i = 1; i <= n; i++)
{
fin >> x >> y;
a[i].x = x;
a[i].c = y;
}
for (i = 1; i <= m; i++)
{
fin >> c >> x >> y;
if (c == 0) Task1(x, x + y);
else if (c == 1) Task2(x, y);
}
return 0;
}