Cod sursa(job #667854)
Utilizator | Data | 23 ianuarie 2012 20:27:41 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 15 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
using namespace std;
#include<fstream>
ifstream f("ssm.in");
ofstream g("ssm.out");
int main()
{
int n,smax,v[1000],s,i,j,x,y;
f>>n;
for(i=1;i<=n;i++)
f>>v[i];
smax=v[i];
x=1;
y=1;
for(i=1;i<=n;i++)
{
s=0;
for(j=i;j<=n;j++)
{
s=s+v[j];
if(s>smax)
{
smax=s;
x=i;
y=j;
}
}
}
g<<smax<<" "<<x<<" "<<y;
return 0;
}