Cod sursa(job #306917)
Utilizator | Bogdan Vlad bugy | Data | 22 aprilie 2009 13:14:24 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.6 kb |
#include<fstream>
using namespace std;
int i,j,s,smax,li,ls,n;
int v[6000000];
int main()
{
ifstream f("ssm.in");
ofstream g("ssm.out");
f>>n;
for(i=1;i<=n;i++)
f>>v[i];
smax=v[1];
for(i=1;i<=n;i++)
{
s=0;
for(j=i;j<=n;j++)
{
s=s+v[j];
if(s>smax)
{smax=s;
li=i;
ls=j;}
}
}
g<<smax<<" "<<li<<" "<<ls<<"\n";
f.close();
g.close();
return 0;
}