Cod sursa(job #609927)
| Utilizator |  Andrei Geogescu mening12001 |
Data | 23 august 2011 21:10:24 |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.32 kb |
#include<fstream.h>
long long s[6000000],a,max=-1000000000;
int main()
{ifstream f("ssm.in");
ofstream h("ssm.out");
int n,i,j,x1,x=1,y;
f>>n;
f>>a;
s[1]=a;
for(i=2;i<=n;i++)
{f>>a;
if(a+s[i-1]>=a)
s[i]=a+s[i-1];
else
{s[i]=a;
x=i;}
if(s[i]>=max)
{x1=x;
max=s[i];
y=i;}}
h<<max<<" "<<x1<<" "<<y;
return 0;}