F.A.Q
Hand In Hand
Online Acmers
Problem Archive
Realtime Judge Status
Authors Ranklist
 
     C/C++/Java Exams     
ACM Steps
Go to Job
Contest LiveCast
ICPC@China
Best Coder beta
VIP | STD Contests
    DIY | Web-DIY beta
Author ID 
Password 
 Register new ID

View Compilation Error

0_0_19225258_10939.cpp:25:41: error: expected unqualified-id before 'for'
 int s[maxn],t[maxn],p,q,ret=0,i,j,k;    for(_clr(match1),_clr(match2),i=0;i<m;ret+=(match1[i++]>=0))        for(_clr(t),s[p=q=0]=i;p<=q&&match1[i]<0;p++)            for(k=s[p],j=0;j<n&&match1[i]<0;j++)                if(mat[k][j]&&t[j]<0)                {                    s[++q]=match2[j],t[j]=k;                    if(s[q]<0)                        for(p=j;p>=0;j=p)                            match2[j]=k=t[j],p=match1[k],match1[k]=j;                }    return ret;} bool Find(int v){     for(int u=0;u<ny;u++)    {        if(!used[u]&&G[v][u])        {             used[u]=1;                if(my[u]==-1||Find(my[u]))                {                    mx[v]=u;my[u]=v; return 1;                }        }    }    return 0;}bool FindY(int v){     for(int u=0;u<ny;u++)    {        if(u!=delY&&!used[u]&&G[v][u])        {            used[u]=1;                if(my[u]==-1||FindY(my[u]))                {                    return 1;                }         }    }    return 0;}bool FindX(int u){    for(int v=0;v<nx;v++)    { if(v!=delX&&!used[v]&&G[v][u])        {            used[v]=1;                if(mx[v]==-1||FindX(mx[v]))                    return 1;        }    }    return 0;}int MMG(){    for(int i=0;i<nx;i++)mx[i]=-1;        for(int j=0;j<ny;j++)my[j]=-1;            
                                         ^


Hangzhou Dianzi University Online Judge 3.0
Copyright © 2005-2024 HDU ACM Team. All Rights Reserved.
Designer & Developer : Wang Rongtao LinLe GaoJie GanLu
Total 0.000000(s) query 1, Server time : 2024-11-26 23:10:42, Gzip enabled