Cod sursa(job #1669071)
Utilizator | Data | 30 martie 2016 12:31:11 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <fstream>
using namespace std;
ifstream in("ssm.in");
ofstream out("ssm.out");
int main()
{
int s=-1,r=1,m,best=-2000000,n,i,k,cnt=0;
in>>n;
for(i=1;i<=n;i++)
{
cnt++;
in>>k;
if(s<0)
{s=0;cnt=0;}
s+=k;
if(s>best)
{
best=s;
m=i;
r=i-cnt;
}
}
out<<best<<" "<<r<<" "<<m;
return 0;
}