Cod sursa(job #1442814)
Utilizator | Data | 26 mai 2015 12:52:24 | |
---|---|---|---|
Problema | Secventa 2 | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.68 kb |
#include<fstream>
#define nmax 50005
using namespace std;
long long n,k,limD,limS,s[nmax];
int main()
{
ifstream f("secv2.in");
ofstream g("secv2.out");
f>>n>>k;
for(int i=1;i<=n;i++)
{
f>>s[i];
s[i]+=s[i-1];
}
long long kMin=0;
long long sMom=-int(2e9);
int sMin=0;
int lMin=0;
for(int i=1;i<=n;i++)
{ lMin=limD-limS+1;
if(s[i]-sMin>sMom&&lMin<=k)
{
sMom=s[i]-sMin;
limS=kMin+1;
limD=i;
}
if(s[i]<sMin)
{
sMin=s[i];
kMin=i;
}
}
g<<limS<<" "<<limD<<" "<<sMom;
return 0;
}