infoarena

Scandura de lungime 6 o taie apoi in 2 scanduri de lungme 3. (din exemplu)

aceasta o taie in maxim M bucati diferite (din enunt)

#include <fstream>
#include <stdio.h>

using namespace std;

int main() {
  ifstream fin("scandura.in");
  ofstream fout("scandura.out");
  
  int n, m, NrBucati=0,i=0;
  int * bucati;
  fin>>n;
  bucati=new int[n];
  fin>>m;
  m--;
  int LungTotala=0;
  while (!fin.eof())
  {
        NrBucati++;
        fin>>bucati[NrBucati];
        LungTotala = LungTotala + bucati[NrBucati];
  }
  int cost=0,chop=0,j;
  for (i=NrBucati;i>1;i=i-m)
  {
      cost=cost+LungTotala;
	  if (m>1)
	  {
		chop = 0; 
		for (j=1;j<=m;j++)
		{
			chop=chop + bucati[(i - j)+1];
			//printf("chop(%d)",chop);
		}
	  }
	  else 
	  {
		chop=bucati[i];
	  }
      LungTotala=LungTotala-chop;
	  //printf("cutt lt(%d)\n",LungTotala);
  }
  //printf("\ncost(%d)",cost);
  //system("pause");
  fout<<cost;
  return 0;  
}

4 2
1 1 1 1

#include<stdio.h>
int main()
{
long l,lpart,efort=0,m,n,i,a,p[1000000],rest;
FILE *fin,*fout;
fin=fopen("scandura.in","r");
fscanf(fin,"%ld %ld",&n,&m);
for(i=1;i<=n;i++)
{
fscanf(fin,"%ld",&a);
efort+=a;
p[i]=a;
}
l=efort;
while(n!=1)
{
for(i=0;i<=m-2;i++)
lpart=l-p[n-i];
rest=p[n-m+2];
efort+=rest;
n=n-m+1;
}
fout=fopen("scandura.out","w");
fprintf(fout,"%ld",efort);
fclose(fin);
fclose(fout);
return 0;
}