1006 Magic Pen 6
链接:http://acm.hdu.edu.cn/showproblem.php?pid=4648
题目的意思就是给你一串数字,让你找出其中最长的一个串使得这些数字之和模M等于0:
那就直接先计算出sum(i) = a1+a2+....+ai;一串数字的和就是这串数字的首数字和末尾数字的sum之差,要使得字符串
最长,那么就使用两个指针,一个从头开始,一个从尾部开始,只要找到满足条件的数字串就直接跳出,这时候的长度
肯定就是最长的了:
#include <iostream>
#include <cstdio>
#include <string>
#include <string.h>
#include <map>
#include <vector>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <queue>
#include <set>
#include <stack>
#include <functional>
#include <fstream>
#include <sstream>
#include <iomanip>
#include <numeric>
#include <cassert>
#include <bitset>
#include <stack>
#include <ctime>
#include <list>
#define INF 0x7fffffff
#define max3(a,b,c) (max(a,b)>c?max(a,b):c)
#define min3(a,b,c) (min(a,b)<c?min(a,b):c)
#define mem(a,b) memset(a,b,sizeof(a))
using namespace std;
#define N 100005
int a[N] ;
__int64 sum[N] ;
int main()
{
int n , m ;
while(cin >> n >> m)
{
mem(sum ,0) ;
for (int i = 1 ; i <= n ; i ++ )
{
scanf("%d",&a[i]) ;
sum[i] = sum[i - 1] + a[i] ;
}
__int64 l = 1 , r = n ;
__int64 ed ;
__int64 ans = 0 ;
__int64 c = sum[n] % m ;
if(sum[n] % m == 0)
{
cout << n << endl;
continue ;
}
int flag = 0 ;
for (int ed = n ; ed >= 1 ; --ed )
{
for (int st = 1 ; st + ed - 1 <= n ; ++st)
{
if((sum[st + ed - 1] - sum[st - 1]) % m == 0)
{
cout << ed << endl;
flag = 1 ;
break ;
}
}
if(flag)
break ;
}
if(!flag)
cout << 0 << endl;
}
return 0 ;
}
1005 Another Graph Game
这道题目一开始想复杂了,想到了删边游戏,太复杂了。既然就是求差,那么可以分情况讨论一下:
若没有边权,则对点权从大到小排序即可。
考虑边,将边权拆成两半加到它所关联的两个点的点权中即可。因为当两个人分别选择不同的点时,这一权值将互相抵消。
#include <iostream>
#include <cstdio>
#include <string>
#include <string.h>
#include <map>
#include <vector>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <queue>
#include <set>
#include <stack>
#include <functional>
#include <fstream>
#include <sstream>
#include <iomanip>
#include <numeric>
#include <cassert>
#include <bitset>
#include <stack>
#include <ctime>
#include <list>
#define INF 0x7fffffff
#define max3(a,b,c) (max(a,b)>c?max(a,b):c)
#define min3(a,b,c) (min(a,b)<c?min(a,b):c)
#define mem(a,b) memset(a,b,sizeof(a))
using namespace std;
#define N 100001
int n, m;
double num[N];
int a, b;
double w;
bool cpp(double a, double b)
{
return a > b;
}
double ans = 0;
int main()
{
while(scanf("%d%d", &n, &m) == 2)
{
mem(num, 0);
ans = 0;
for(int i = 0; i < n; ++i)
scanf("%lf", &num[i]);
for(int i = 0; i < m; ++i)
{
scanf("%d%d%lf", &a, &b, &w);
num[a-1] += w/2.0;
num[b-1] += w/2.0;
}
sort(num, num + n, cpp);
double la = 0, lb = 0;
for(int i = 0; i < n ; i = i + 2)
{
ans += num[i] - num[i+1];
}
printf("%.0lf\n",ans);
}
return 0;
}
数论? 真的不会
题目大意:将一个数n拆分成几个数相加,问有多少种方案?
思路:
参见五边形定理。。 http://en.wikipedia.org/wiki/Partition_(number_theory)
#include <iostream>
#include <cstdio>
#include <string>
#include <string.h>
#include <map>
#include <vector>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <queue>
#include <set>
#include <stack>
#include <functional>
#include <fstream>
#include <sstream>
#include <iomanip>
#include <numeric>
#include <cassert>
#include <bitset>
#include <stack>
#include <ctime>
#include <list>
#define INF 0x7fffffff
#define max3(a,b,c) (max(a,b)>c?max(a,b):c)
#define min3(a,b,c) (min(a,b)<c?min(a,b):c)
#define mem(a,b) memset(a,b,sizeof(a))
using namespace std;
const int mod = 1e9+7;
#define N 100020
int p[N];
void Partition()
{
p[0] =1;
for(int n = 1; n <= 1e5; ++n)
{
int fac = 1;
int k =1;
while(1)
{
int t = n - k * (3 * k - 1) / 2;
if(t < 0)
break;
p[n] = (p[n] + fac * p[t])%mod;
if(t-k >= 0)
p[n] = (p[n] + fac*p[t-k])%mod;
p[n] %= mod;
fac = -fac;
++k;
}
p[n] = (p[n] + mod) % mod;
}
}
int main()
{
Partition();
int d;
scanf("%d",&d);
while(d--)
{
int c;
scanf("%d",&c);
printf("%d\n",p[c]);
}
return 0;
}