Cod sursa(job #1325784)
Utilizator | Data | 24 ianuarie 2015 12:53:06 | |
---|---|---|---|
Problema | Secventa | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.6 kb |
#include <iostream>
using namespace std;
int main ()
{
int t[10]={-1,2,3,1,0,4,8,6},n=8,k=3;
int max=t[0]+t[1]+t[2];
int poz=0;
for (int i=1;i<=n-k;i++)
{
int ossz=0;
for (int j=i;j<=i+k;j++)
ossz=ossz+t[j];
if (ossz>max)
{
max=ossz;
poz=i+1;
}
}
int min=t[poz];
for (int i=poz+1;i<=poz+k;i++)
{
// cout<<t[i]<<" ";
}
for (int i=poz+1;i<poz+k;i++)
{
if (t[i]<min)
min=t[i];
}
cout<<poz+1<<" "<<poz+k<<" "<<min;
}