Cod sursa(job #1452171)
Utilizator | Data | 20 iunie 2015 10:23:08 | |
---|---|---|---|
Problema | Secventa 2 | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.74 kb |
#include <fstream>
using namespace std;
ifstream fin("secv2.in");
ofstream fout("secv2.out");
int v[50010],i,contorMin,sum,sumMax = -1250000000,in,sf,elemMin = 1250000000,n,k;
int main()
{
fin>>n>>k;
for( i = 1 ; i <= n ; ++i )
{
fin>>v[ i ];
v[ i ] += v[ i - 1 ];
if( i >= k )
{
if( v[ contorMin ] < elemMin )
{
elemMin = v[ contorMin ];
in = contorMin + 1;
}
sum = v[ i ] - elemMin;
if( sum > sumMax )
{
sumMax = sum;
sf = i;
}
++contorMin;
}
}
fout<<in<<' '<<sf<<' '<<sumMax;
return 0;
}