Cod sursa(job #2340454)
Utilizator | Bogdan Dumitrescu bogdan2604 | Data | 10 februarie 2019 14:23:26 |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <fstream>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int n,i,inc,v[100000],sum,sumx=INT_MIN,af1,af2;
int main()
{
f>>n;
for(i=0; i<n; ++i)
f>>v[i];
for(i=0; i<n; ++i)
{
if(sum<0)
sum=v[i],inc=i;
else
sum+=v[i];
if(sum>sumx)
sumx=sum,af1=inc,af2=i;
}
g<<af1+1<<' ' <<af2+1;
}