Cod sursa(job #882964)
Utilizator | Data | 19 februarie 2013 16:45:12 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include<fstream>
using namespace std;
int s,n,i,k,x,u,p,m=-2000000000;
int main()
{
ifstream q("ssm.in");
ofstream w("ssm.out");
q>>n;
for(i=0; i<n; i++)
{
q>>x;
if(s<0)
{
k=i;
s=0;
}
s+=x;
if(s>m)
{
m=s;
p=k;
u=i;
}
}
w<<m<<" "<<p+1<<" "<<u+1;
return 0;
}