int find(int x)
{
    if(f[x]!=x)
		f[x]=find(f[x]);
    return f[x];
}

void process()
{
	int i,j,k,a,b;
	for( i=0; i<=l+10; i++ )  f[i] = i;

	for( k=1; k<=m; k++ )
	{
		i = arr[k].i;   j = arr[k].j;
		a = find(i-1);  b = find(j);
		if( a==b )
		{
			if( d[i-1]-d[j]!=arr[k].v )  printf("Bug Detected %d\n",d[i-1]-d[j]);
			else                         printf("Accept\n");
		}
		else{
			f[b] = a;  d[b] = d[i-1]-d[j]-arr[k].v;
			printf("Accept\n");
		}
	}
}

• Re:Beg some propositions of my wrong code (633) frkstyc 2006-05-30 23:04:13
  • Re:Beg some propositions of my wrong code (71) zerk 2006-05-30 23:08:48
    • Re:Beg some propositions of my wrong code (125) frkstyc 2006-05-30 23:22:31
• 看大不懂，反正和1984,1184 之类的一样做就是了 (543) cuiaoxiang 2006-05-31 13:35:12
  • 1733…… (0) frkstyc 2006-05-31 13:36:35
    • 果然很像啊 (0) cuiaoxiang 2006-05-31 13:42:28