Cod sursa(job #418054)
| Utilizator | Data | 15 martie 2010 12:55:09 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 15 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.44 kb |
#include <iostream>
#include <fstream>
using namespace std;
ofstream g("ssm.out");
int i,n,sc,a[6000000],s[6000000],j,k,dr,st,maxim=-20000000;
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;
g.close();
f.close();
return 0;
}
