Cod sursa(job #3136748)
| Utilizator | Data | 8 iunie 2023 11:44:15 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 85 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#include <fstream>
using namespace std;
ifstream in("ssm.in");
ofstream out("ssm.out");
int n,mini=999999999,st,dr;
long long v[6000005];
int main()
{
in>>n;
for(int i=1; i<=n; i++)
{in>>v[i];
v[i]=v[i-1]+v[i];}
int maxi=v[1];
for(int i=1; i<=n; i++)
{
if(maxi<v[i]-mini)
{
maxi=v[i]-mini;
dr=i;
}
if(v[i]<mini)
{mini=v[i];
st=i+1;}
}
out<<maxi<<" "<<st<<" "<<dr;
return 0;
}
