Cod sursa(job #2567200)
| Utilizator | Data | 3 martie 2020 15:50:55 | |
|---|---|---|---|
| Problema | Secventa 2 | Scor | 80 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.87 kb |
#include <iostream>
#include <fstream>
#include <deque>
using namespace std;
ifstream fin("secv2.in");
ofstream fout("secv2.out");
std::deque<int>dp,dn;
int x[50001];
int main()
{
int n,k;
fin>>n>>k;
long long s=0,ma=0,pi=0,pf=0;
for(int i=1;i<=n;i++)
{
fin>>x[i];
if(x[i]>=0)
{
if(x[i]+s>=ma)
{
ma=s+x[i];
if(s==0)
{
pi=i;
}
else
{
pf=i;
}
}
s=s+x[i];
}
else
{
if(s+x[i]<0)
{
s=0;
}
else
{
s=s+x[i];
}
}
}
fout<<pi<<" "<<pf<<" "<<ma;
return 0;
}
