Cod sursa(job #640422)
Utilizator | Data | 25 noiembrie 2011 18:09:01 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.86 kb |
#include <iostream>
#define inf -2000000
using namespace std;
int main()
{
int v[30],i,n,max,s,k,j,l,m,p,q,a[30];
max=inf;
cout << "n=";cin>>n;
for (i=1;i<=n;i++)
cin>>v[i];
k=1;
m=n;
while (k<=n)
{
for (i=1;i<=m;i++)
{
j=1;
s=0;
l=i;
while (j<=k)
{
s=s+v[l];
l++;
j++;
}
if (s>max)
{
p=1;
q=i;
while (p<=k)
{
a[p]=v[q];
p++;
q++;
}
max=s;
}
}
m--;
k++;
}
for (i=1;i<=p-1;i++)
cout<<a[i]<<" ";
cout<<"\nmax="<<max;
return 0;
}