Cod sursa(job #954991)
| Utilizator | Data | 30 mai 2013 16:23:17 | |
|---|---|---|---|
| Problema | Secventa 2 | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.55 kb |
#include <fstream>
using namespace std;
ifstream f("secv2.in");
ofstream g("secv2.out");
int i,n,mi=100000,k,ma=-100000000,ff,a,s[50000],v[50000];
int main()
{
f>>n>>k;
for (i=1;i<=n;i++)
{
f>>v[i];
s[i]=s[i-1]+v[i];
}
for (i=k;i<=n;i++)
if (s[i]>ma)
{
ma=s[i];
ff=i;
}
for (i=1;i<=ff-k;i++)
if (s[i]<mi)
{
mi=s[i];
a=i;
}
if (mi>=0)
g<<"1 "<<ff<<" "<<ma;
else
g<<a+1<<" "<<ff<<" "<<ma-mi;
f.close();
g.close();
}