Pagini recente » Cod sursa (job #213672) | Cod sursa (job #2676354) | Cod sursa (job #2466187) | Cod sursa (job #1339906) | Cod sursa (job #967228)
Cod sursa(job #967228)
#include<fstream>
#define dim 3509
using namespace std;
ifstream f("cutii.in");
ofstream g("cutii.out");
struct cutii
{
int x,y,z;
};
cutii a[dim];
int n,t;
void sortare()
{
int i,j;
int aux1,aux2,aux3;
for(i=1;i<n;i++)
for(j=i;j<=n;j++)
if(a[i].z>a[j].z)
{
aux1=a[i].x,a[i].x=a[j].x,a[j].x=aux1;
aux2=a[i].y,a[i].y=a[j].y,a[j].y=aux2;
aux3=a[i].z,a[i].z=a[j].z,a[j].z=aux3;
}
}
int xx[dim],x[dim],stt;
void scmax()
{
int st,dr,mij,s;
xx[1]=1;
s=1;
for(int i=2;i<=n;i++)
{
st=1;
dr=s;
while(st<=dr)
{
mij=(st+dr)/2;
if(a[i].y>a[x[mij]].y)
st=mij+1;
else
dr=mij-1;
}
if(st>s)
s++;
xx[st]=i;
stt=st;
}
}
int nr;
void scmax2()
{
int st,dr,mij,s;
x[1]=xx[stt];
s=1;
for(int i=xx[stt-1];i<=xx[1];i++)
{
st=1;
dr=s;
while(st<=dr)
{
mij=(st+dr)/2;
if(a[i].x>a[x[mij]].x)
st=mij+1;
else
dr=mij-1;
}
if(st>s)
s++;
x[st]=i;
nr=st;
}
}
int main()
{
int i,k;
int x,y,z;
f>>n>>t;
for(k=1;k<=t;k++)
{
for(i=1;i<=n;i++)
{
f>>x>>y>>z;
a[i].x=x;
a[i].y=y;
a[i].z=z;
}
scmax();
scmax2();
}
}