Submission #1453274

---

Source Code Expand

/*
	% D a l a o
          --InterestingLSY
*/
#include <iostream>
#include <cstdio>
#include <cmath>
#include <vector>
#include <cstring>
#include <stack>
#include <queue>
#include <algorithm>
#include <set>
#include <map>
#define pb push_back
#define mp make_pair
#define INF (1e9)
#define LINF (1e18)
#define SINF "%"
#define uint unsigned int
#define msn(a,v) memset(a,v,sizeof(a))
#define ms(a) msn(a,0)
#define NONE -1
#define ll long long
#define uchar unsigned char
#define sint short int
#define usint unsigned sint
using namespace std;
#define MAXN 2000
#define P +MAXN
 
int n;
int l[MAXN],r[MAXN];
int len[MAXN];
 
int mem[MAXN][MAXN P];
int myabs( int x ){
	if( x >= 0 ) return x;
	else return -x;
}
int dp(int pos,int lastl){
	if(pos == n+1) return 0;
	if(mem[pos][lastl P] != -1) return mem[pos][lastl P];
	int ans = INF;
	for(int nowl = lastl-len[pos];nowl <= lastl+len[pos-1];nowl++){
		int nowans = dp(pos+1,nowl) + myabs(l[pos]-nowl);
		if( ans > nowans ){
			ans = nowans;
		}
	}
	mem[pos][lastl P] = ans;
	return ans;
}
int main(){
	//freopen("E.txt","r",stdin);
	msn(mem,-1);
	
	scanf("%d",&n);
	for(int i = 1;i <= n;i++){
		scanf("%d %d",&l[i],&r[i]);
		len[i] = r[i] - l[i];
	}
	
	int ans = INF;
	for(int i = -MAXN;i <= MAXN;i++){
		int nowans = dp(2,i) + myabs(i-l[1]);
		if( ans > nowans ){
			ans = nowans;
		}
	}
		
	printf("%d\n\n",ans);
	
	return 0;
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:58:16: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&n);
                ^
./Main.cpp:60:29: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d",&l[i],&r[i]);
                             ^

Judge Result