Cod sursa(job #1863711)
Utilizator | Data | 31 ianuarie 2017 09:41:13 | |
---|---|---|---|
Problema | Secventa 2 | Scor | 90 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.68 kb |
#include <fstream>
#include <climits>
#define DM 50005
#define x first
#define y second
using namespace std;
ifstream f("secv2.in");
ofstream g("secv2.out");
int maxS=LONG_LONG_MIN, mini=INT_MAX, ssp[DM], maxI, maxJ, I;
int main()
{
int n, k, m, t, centr, pet;
f>>n>>k;
for(int i=1; i<=n; i++)
{
f>>m;
ssp[i]=ssp[i-1]+m;
if(i>=k)
{
if(ssp[i-k]<mini)
mini=ssp[i-k], I=i-k;
if(ssp[i]-mini>maxS)
{
maxS=ssp[i]-mini;
maxI=I+1;
maxJ=i;
}
}
}
g<<maxI<<" "<<maxJ<<" "<<maxS;
return 0;
}