Cod sursa(job #2394402)
| Utilizator | Data | 1 aprilie 2019 16:46:40 | |
|---|---|---|---|
| Problema | Subsecventa de suma maxima | Scor | 55 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.5 kb |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
ifstream f("ssm.in");
ofstream g("ssm.out");
ll n, s1, s, x=1, y, maxim=INT_MIN, minim=INT_MAX;
vector<ll>v;
int main()
{
f>>n;
for(ll i=1; i<=n; i++)
{
ll x;
f>>x;
v.push_back(x);
}
for(ll i=0; i<v.size(); i++)
{
s+=v[i];
if(minim>s) minim=s, x=i+1;
if(maxim<s-minim) maxim=s-minim, y=i;
}
g<<maxim<<' '<<x+1<<' '<<y+1;
return 0;
}
