Cod sursa(job #664066)
Utilizator | David Chirita davidchirita | Data | 19 ianuarie 2012 16:02:30 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <fstream>
using namespace std;
int v[6000001],n;
int main()
{
int maxim,st,dr,i,x,j,s;
ifstream f("ssm.in");
ofstream g("ssm.out");
f>>n;
for(i=1;i<=n;i++)
f>>v[i];
f.close();
maxim=v[1];
st=1;
dr=1;
for(i=1;i<=n;i++)
for(j=i;j<=n;j++)
{
s=0;
for(x=i;x<=j;x++)
s=s+v[x];
if(maxim<s) {maxim=s; st=i;dr=j;}
}
g<<maxim<<" "<<st<<" "<<dr<<"\n";
g.close();
return 0;
}