Cod sursa(job #2658861)
Utilizator | Data | 15 octombrie 2020 12:35:12 | |
---|---|---|---|
Problema | Subsecventa de suma maxima | Scor | 85 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
int x,sum,s[60000000];
int pos,pos1,sum1,maxim,n;
int main()
{
f>>n;
for(int i=1; i<=n; i++)
{
f>>x;
sum+=x;
if(sum-sum1>maxim)
{
maxim=sum-sum1;
pos=i;
}
else {if(sum<sum1)
{
sum1=sum;
pos1=i;
}}
}
g<<maxim<<" "<<pos1+1<<" "<<pos;
return 0;
}