Cod sursa(job #418055)
| Utilizator | Data | 15 martie 2010 12:55:18 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 15 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.43 kb |
#include<iostream>
#include<fstream>
using namespace std;
ofstream g("ssm.out");
int maxim=-2000000000,n,a[600001],s[600001],i,k,j,st,dr;
int main()
{ ifstream f("ssm.in");
f>>n;
for(i=1;i<=n;i++)
f>>a[i];
for(i=1;i<=n;i++)
for(j=i+1;j<=n;j++)
{ int sc=0;
for(k=i;k<=j;k++)
sc+=a[k];
if(sc>maxim)
{ maxim=sc;st=i;dr=j;}
}
g<<maxim<<" "<<st<<" "<<dr;
f.close();
g.close();
return 0;
}
