Cod sursa(job #812655)
Utilizator | Data | 14 noiembrie 2012 09:58:21 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <fstream>
using namespace std;
ifstream fin("ssm.in");
ofstream fout("ssm.out");
int v[6000003], n;
int main()
{
fin>>n;
int i, s=0, smax,st,dr;
for(i=1;i<=n;i++)
fin>>v[i];
int j;
smax=v[1];
st=dr=1;
while(n>1)
{
for(j=n;j>0;j--)
{
s+=v[j];
if (s>=smax) {smax=s; st=j;dr=n;}
}
s=0;
n--;
}
fout<<smax<<" "<<st<<" "<<dr<<"\n";
return 0;
}