Pagini recente » Cod sursa (job #833589) | Cod sursa (job #134501) | Cod sursa (job #2088866) | Cod sursa (job #2584963) | Cod sursa (job #2100732)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("secv2.in");
ofstream g("secv2.out");
int main()
{
int N,K;
f>>N>>K;
int S[N];
long sum=0,maxs=-25001,mins=25001;
int x,maxp1,maxp2;
for(int i=0;i<N;i++)
{
f>>x;
sum+=x;
S[i]=sum;
if(maxs<S[i])
{
maxs=S[i];
maxp1=i;
}
}
for(int i=0;i<maxp1;i++)
{
if(S[i]<mins)
{
mins=S[i];
maxp2=i;
}
}
int S1 = min(maxp1,maxp2)+1,S2=max(maxp1,maxp2);
g<<S1+1<<" "<<S2+1<<" "<<S[S2]-S[S1-1];
return 0;
}