Pagini recente » Cod sursa (job #1950993) | Cod sursa (job #2481988) | Cod sursa (job #2531217) | Cod sursa (job #519402) | Cod sursa (job #3179013)
#include <fstream>
#include <queue>
using namespace std;
ifstream cin("ssm.in");
ofstream cout("ssm.out");
int n, x, dr, st, cnt, smax, s, ind;
queue<int> q;
int main()
{
cin>>n;
for(int i=1; i<=n; i++)
{
cin>>x;
q.push(x);
}
dr=st=cnt=ind=1;;
smax=s=q.front();
q.pop();
while(!q.empty())
{
ind++;
if(s+q.front()>q.front())
{
s+=q.front();
}
else
{
s=q.front();
cnt=ind;
}
if(s>smax)
{
smax=s;
st=cnt;
dr=ind;
}
q.pop();
}
cout<<smax<<' '<<st<<' '<<dr;
return 0;
}