Pagini recente » Cod sursa (job #2666934) | Cod sursa (job #1129586) | Cod sursa (job #2281067) | Cod sursa (job #2307859) | Cod sursa (job #1317907)
#include <fstream>
using namespace std;
ifstream in("pinochio.in");
ofstream out("pinochio.out");
int N,K,Max,nr,V[5005],fr[1001];
void cit2()
{
in>>N>>K;
for(int i=1;i<=N;i++)
in>>V[i];
}
void rez2()
{
int j;
for(int i=1;i<=N;i++)
{
int max=V[i],min=V[i];
fr[V[i]]=1;
for(j=i;j<=N;j++)
{
if(fr[V[j]]) j=N=1;
else
{
fr[V[j]]=1;
if(max<V[j]) max=V[j];
if(min>V[j]) min=V[j];
int K=j-i+1;
if((max-min+1)==K)
{
if(Max<K) {Max=K;nr=0;}
if(Max==K) {nr++;}
}
}
}
for(int z=i;z<=j-1;z++)
{
fr[V[z]]=0;
}
}
}
int main()
{
int P;in>>P;
if(P==1)
{
}
else
{
cit2();
rez2();
}
return 0;
}