Pagini recente » Cod sursa (job #1789939) | Cod sursa (job #175854) | Cod sursa (job #2655764) | Cod sursa (job #2680464) | Cod sursa (job #141306)
Cod sursa(job #141306)
#include <stdio.h>
int n,x[2001],partide[2001],nrpartide;
int main()
{
freopen("politic.in","r",stdin);
freopen("politic.out","w",stdout);
scanf("%d",&n);
x[0]=-1;
nrpartide=0;
for (int i=1;i<=n;i++)
{
scanf("%d",&x[i]);
if ( x[i] != x[i-1]+1 )
{
nrpartide++;
}
partide[i]=nrpartide;
}
printf("%d\n",nrpartide);
printf("2");
/*int k=n/2+1;
int contord=k;
int contors=1;
while ( x[contord] == x[contord-1]+1 && contord <= n )
{
contord++;
}
long nrpos=nrpartide-partide[contord]+1;
int majorit=contord;
while ( contord < n )
{
while ( x[contors]+1 == x[contors+1] && contord < n && )
{
contors++;
contord++;
}
if ( contord < n )
{
contors++;
contord++;
}
while ( majorit < k && contord < n )
{
majorit++;
}
while ( x[contord]+1 == x[contord+1] && contord < n )
{
majorit++;
contord++;
}
if ( majorit >= k )
{
nrpos+=nrpartide-partide[contord]+1;
}
}
printf("%ld",nrpos);*/
fclose(stdout);
return 0;
}