Cod sursa(job #1829621)
Utilizator | Data | 15 decembrie 2016 14:26:05 | |
---|---|---|---|
Problema | Secventa 2 | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.68 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("secv2.in");
ofstream g("secv2.out");
long long n,a[50001],i,k,x,j,max1,ic,pi,sf,sc,s;
int main()
{
f>>n>>k;
for(i=1;i<=n;i++)
f>>a[i];
for(j=1;j<=n;j++)
{
x=a[j];
for(i=2;i<=n;i++)
{
if(a[i]>x)
{
if(sc==0)
pi=i;
sc++;
}
else sc=0;
if(sc>=k)
{
max1=sc;
ic=pi;
sf=i;
}
}
}
for(i=ic;i<=sf;i++)
s=s+a[i];
g<<ic<<" "<<sf<<" "<<s;
return 0;
}