Cod sursa(job #509722)
Utilizator | Data | 11 decembrie 2010 17:00:27 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include<fstream>
using namespace std;
int main()
{
long *a;
long s=0,i,j,n,k,max=-32000,q,w;
ifstream f("ssm.in");
ofstream g("ssm.out");
f>>n;
a=(long*)malloc(sizeof(long)*n);
for(i=0;i<n;i++)
f>>*(a+i);
for(i=0;i<n;i++)
{s=0;
for(j=i;j<n;j++)
{
s+=a[j];
if(s>max){max=s; q=i; w=j;}
}
}
g<<max<<" "<<q+1<<" "<<w+1;
}