Cod sursa(job #2466104)
| Utilizator | Data | 1 octombrie 2019 15:35:41 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.66 kb |
#include <fstream>
#include <iostream>
using namespace std;
ifstream in("ssm.in");
ofstream out("ssm.out");
int v[6000005];
int main()
{
int n,mini=0,j=0,summax=-1000000000,ii,jj;
in>>n;
for(int i=1;i<=n;i++)
{
in>>v[i];
v[i]+=v[i-1];
}
for(int i=1;i<=n;i++)
{
int sum=v[i]-mini;
if(sum>summax)
{
summax=sum;
ii=i;
jj=j;
}
if(v[i]<mini)
{
mini=v[i];
j=i;
}
}
out<<summax<<" "<<jj+1<<" "<<ii;
return 0;
}
