Cod sursa(job #640435)
Utilizator | Data | 25 noiembrie 2011 18:37:14 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.74 kb |
#include <iostream>
#include <fstream>
#define inf -2000000
using namespace std;
int main()
{
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int v[30],i,n,max,s,k,j,l,m,p,q,a[30];
max=inf;
fin>>n;
for (i=1;i<=n;i++)
fin>>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=l;
q=i;
max=s;
}
}
m--;
k++;
}
fout<<max<<" "<<q<<" "<<p-1;
return 0;
}