Cod sursa(job #254451)
Utilizator | Data | 7 februarie 2009 12:13:32 | |
---|---|---|---|
Problema | Cuburi2 | Scor | 50 |
Compilator | cpp | Status | done |
Runda | Stelele Informaticii 2009, clasele 9-10, ziua 2 | Marime | 0.78 kb |
#include<stdio.h>
int x[250000],i,j,k,l,m,n,a,b;
unsigned long long int s1,s2,c;
int main(){
FILE *f=fopen("cuburi2.in","r");
fscanf(f,"%d%d",&n,&m);
for(i=1;i<=n;i++)
fscanf(f,"%d",&x[i]);
FILE *g=fopen("cuburi2.out","w");
for(i=1;i<=m;i++)
{fscanf(f,"%d%d",&a,&b);
s1=x[a];
s2=x[b];
while(a!=b)
{
if(s1<s2)
{a++;
c+=s1;
s1+=x[a];
}
else
{b--;
c+=s2;
s2+=x[b];
}
}
fprintf(g,"%d %lld\n",b,c);
s1=s2=c=0;
}
fclose(f);
fclose(g);
return 0;}