Cod sursa(job #972249)
Utilizator | Data | 11 iulie 2013 12:49:02 | |
---|---|---|---|
Problema | Secventa 2 | Scor | 60 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.36 kb |
using namespace std;
#include<fstream>
ifstream eu("secv2.in");
ofstream tu("secv2.out");
int x[600000],n,k;
int main()
{
int i,Sk=0,end,max;
eu>>n>>k;
for(i=1;i<=n;i++)
eu>>x[i];
for(i=1;i<=k;i++)
Sk+=x[i];
max=Sk;end=k;
for(i=k+1;i<=n;i++)
{
Sk=Sk+x[i];
if(Sk>max)
{
max=Sk;
end=i;
}
}
tu<<"1 "<<end<<" "<<max;
}