Cod sursa(job #538276)
| Utilizator |  todea darius TodeaDarius |
Data | 20 februarie 2011 23:35:51 |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 85 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.35 kb |
#include<fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int n,i,st,dr,a,max1,x;
int main()
{ f>>n;
st=1;dr=1;
for(i=1;i<=n;i++)
{
f>>x;
a=a+x;
if(a<x)
{
st=i;
a=x;
max1=a;
}
else
{
if(a>max1)
{
max1=a;
dr=i;
}
}
}
g<<max1<<' '<<st<<' '<<dr;
return 0;
}