Cod sursa(job #899980)
Utilizator | Data | 28 februarie 2013 17:11:43 | |
---|---|---|---|
Problema | Secventa 2 | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.44 kb |
#include <iostream>
#include <fstream>
using namespace std;
int i,n,a[100],k,l,s,m,p,u;
int main()
{
ifstream f("secv2.in");
ofstream g("secv2.out");
f>>n>>k;
for(i=1;i<=n;i++)
{
f>>a[i];
}
m=a[1]+a[2]+a[3];
s=0;
l=1;
while(l<=n-k){
for(i=l;i<=n;i++)
{
s=s+a[i];
if(i>=l+k&&s>=m){p=l;u=i;m=s;}
}
l++;
s=0;}
g<<p<<" "<<u<<" "<<m;
}