Pagini recente » Cod sursa (job #110682) | Cod sursa (job #23417) | Cod sursa (job #556602) | Cod sursa (job #1773511) | Cod sursa (job #1471596)
#include <fstream>
using namespace std;
int v[20002], nr, n, k, par[20002];
int main()
{
ifstream f("politic.in");
ofstream g("politic.out");
f>>n;
for (int i=1; i<=n; i++)
f>>v[i];
nr=1;
k=1;
for (int i=1; i<=n-1; i++)
{
if (v[i]!=v[i+1]-1) {nr++; k=1;}
else
{
k++;
par[nr]=k;
}
if (par[nr]==0) par[nr]=1;
}
if (par[1]==0) par[1]=1;
int nrCoal=0;
for (int i=1; i<=nr; i++)
{
k=i;
int s=0;
while (s<=n/2)
{
s += par[k];
k++;
if (k>nr) break;
}
k--;
if (s>n/2) nrCoal++;
else break;
for (int j=k+1; j<=nr; j++)
nrCoal++;
}
g<<nr<<'\n'<<nrCoal;
return 0;
}